爱冲浪的懒羊羊

分类

/ 注册

全部文章（共18篇）

题解 | #字符个数统计#

#include <iostream> #include<string> #include<map> using namespace std; int main() { string str;//string小写 cin>>str; ...

2023-03-21

0 271

题解 | #数组中出现次数超过一半的数字#

class Solution { public: int MoreThanHalfNum_Solution(vector<int> numbers) { sort(numbers.begin(),numbers.end());//先从小到大排序 ...

2023-03-19

0 285

题解 | #两数之和#

#include <unordered_map> class Solution { public: /** * * @param numbers int整型vector * @param target int整型 * @return ...

2023-03-19

0 280

题解 | #二叉搜索树的最近公共祖先#

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

2023-03-17

0 305

题解 | #二叉树的镜像#

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

2023-03-14

0 267

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

class Solution { public: int Depth(TreeNode* Root) {//先求二叉树的最大深度，前面有道题就是该思路； if (!Root) return 0;//考虑特殊情况 return max(Depth(Root-...

2023-03-13

0 336

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

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

2023-03-13

0 258

题解 | #合并二叉树#

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

2023-03-12

0 258

题解 | #二叉树的后序遍历#

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

2023-03-12

0 320

题解 | #二叉树的前序遍历#

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

2023-03-08

0 312