sdnu_ray

题解

/ 注册

全部文章 / 题解（共39篇）

题解 | #重建二叉树#

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

C++

2022-05-03

0 276

题解 | #重建二叉树#

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

C++

2022-05-02

0 292

题解 | #在二叉树中找到两个节点的最近公共祖先#

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

C++

2022-05-02

0 245

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

public: bool IsBalanced_Solution(TreeNode* pRoot) { if(!pRoot) return true; int left=deep(pRoot->left); ...

C++

2022-04-28

0 244

题解 | #判断是不是完全二叉树#

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

C++

2022-04-28

0 331

题解 | #二叉树的镜像#

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

C++

2022-04-27

0 257

题解 | #二叉树的镜像#

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

C++

2022-04-27

0 260

题解 | #合并二叉树#

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

C++

2022-04-27

0 236

题解 | #合并二叉树#

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

C++

2022-04-27

0 259

题解 | #对称的二叉树#

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

C++

2022-04-26

0 252