cherryoa

分类

/ 注册

全部文章（共19篇）

题解 | #反转链表#

/* struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) { } };*/ class Solution { publ...

2023-04-29

0 227

题解 | #两数之和#

#include <map> #include<iostream> #include<cstdio> class Solution { public: /** * * @param numbers int整型vector ...

2023-04-18

0 215

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

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

2023-04-18

0 193

题解 | #按之字形顺序打印二叉树#

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

2023-04-18

0 254

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

/** * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ #include <queue> #include <vector> cl...

2023-04-18

0 205

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

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

2023-04-18

0 179

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

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

2023-04-18

0 173

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

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

2023-04-17

1 220

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

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

2023-04-17

3 418