Coming680

分类

题解(105)

/ 注册

全部文章（共105篇）

题解 | #两数之和#

class Solution { public: /** * * @param numbers int整型vector * @param target int整型 * @return int整型vector */ vector&...

C++ 数组数学·

2022-03-07

0 359

题解 | #最小的K个数#

class Solution { public: int partition(vector<int> &a,int left,int right){ int i = left; for(int j = left + 1;j <= ri...

C++ 二分查找

2022-03-07

0 314

题解 | #最小的K个数#

class Solution { public: int partition(vector<int> &input,int l,int r){ int pivot = input[l]; int i = l; for(int...

C++ 二分查找快速排序

2022-03-07

0 299

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

模拟题，直接模拟过程即可。 class Solution { public: /** * lru design * @param operators int整型vector<vector<>> the ops * @param k int...

C++ 数组模拟队列

2022-03-07

0 338

题解 | #螺旋矩阵#

class Solution { public: vector<int> spiralOrder(vector<vector<int> >& matrix) { vector<int> ans; if(m...

C++ 数组枚举

2022-03-07

0 375

题解 | #重建二叉树#

/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x),...

C++ 深度优先搜索二叉树

2022-03-07

0 296

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

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

C++ 深度优先搜索二叉树

2022-03-06

0 300

题解 | #二叉树的镜像#

/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {...

C++ 深度优先搜索二叉树

2022-03-06

0 306

题解 | #判断是不是平衡二叉树#

class Solution { public: bool result = true; int dfs(TreeNode* pRoot){ if(pRoot == NULL) return 0; int left = dfs(...

C++ 深度优先搜索二叉树

2022-03-06

0 299

题解 | #二叉树的最大深度#

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

C++ 深度优先搜索

2022-03-06

0 299