孤城201801220924292

分类

题解(9)

/ 注册

全部文章（共9篇）

题解 | #寻找第K大#

class Solution { public: int findKth(vector<int> a, int n, int K) { // write code here if(K <= 0)return -1; ...

C++

2021-09-18

0 331

题解 | #实现二叉树先序，中序和后序遍历#

/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ class Solution { public: /** * ...

C++

2021-09-18

3 443

题解 | #合并两个有序的数组#

class Solution { public: void merge(int A[], int m, int B[], int n) { /* if(n == 0)return; for(int i = 0; i < n; i...

C++

2021-09-18

0 305

题解 | #最小的K个数#

class Solution { public: vector<int> GetLeastNumbers_Solution(vector<int> input, int k) { vector<int> vecLeastNumbe...

C++

2021-09-18

0 302

题解 | #求二叉树的层序遍历#

/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ class Solution { public: /** * ...

C++

2021-09-18

0 316

题解 | #二分查找-II#

class Solution { public: /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * 如果目标值存在返回下标，否则返回 -1 * @param nums int整型vector * ...

C++

2021-09-18

0 348

题解 | #用两个栈实现队列#

class Solution { public: void push(int node) { stack1.push(node); } int pop() { while(!stack1.empty()) ...

C++

2021-09-17

0 275

题解 | #判断链表中是否有环#

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} ...

C++

2021-09-17

0 248

题解 | #设计LRU缓存结构#

class Solution { public: /** * lru design * @param operators int整型vector<vector<>> the ops * @param k int整型 the k ...

C++

2021-09-17

0 275