sdnu_ray

分类

题解(42)

/ 注册

全部文章（共42篇）

题解 | #链表中的节点每k个一组翻转#

* struct ListNode { * int val; * struct ListNode *next; * }; */ class Solution { public: /** * * @param head ListNode类 * @pa...

C++

2022-05-06

0 237

题解 | #链表内指定区间反转#

* struct ListNode { * int val; * struct ListNode *next; * }; */ class Solution { public: /** * * @param head ListNode类 * @pa...

C++

2022-05-03

0 301

题解 | #输出二叉树的右视图#

public: /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * 求二叉树的右视图 * @param xianxu int整型vector 先序遍历 * @param zhongxu int整型vector 中序...

C++

2022-05-03

0 309

题解 | #重建二叉树#

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

C++

2022-05-03

0 269

题解 | #重建二叉树#

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

C++

2022-05-02

0 277

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

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

C++

2022-05-02

0 233

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

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

C++

2022-04-28

0 234

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

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

C++

2022-04-28

0 321

题解 | #二叉树的镜像#

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

C++

2022-04-27

0 248

题解 | #二叉树的镜像#

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

C++

2022-04-27

0 253