a天河朔夜a

分类

/ 注册

全部文章（共72篇）

题解 | #合并二叉树#

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

2023-03-14

0 221

题解 | #对称的二叉树#

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

2023-03-14

0 237

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

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

2023-03-07

0 250

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

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

2023-03-07

0 265

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

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

2023-03-06

0 174

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

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

2023-03-06

0 232

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

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

2023-03-06

0 211

题解 | #旋转数组的最小数字#

/** * * @param rotateArray int整型一维数组 * @param rotateArrayLen int rotateArray数组长度 * @return(756076230) int整型 */ int minNumberInRotateArray(int* ...

2023-03-06

0 236

题解 | #数组中的逆序对#

class Solution { public: int so(vector<int>&data,int l,int r) { if(l>=r)return 0; int mid=(l+r)>>1,result=(so(d...

2023-03-06

0 198

题解 | #链表相加(二)#

struct ListNode*addlist(struct ListNode*a,struct ListNode*b,int cnt)//cnt进位 { if(a!=NULL&&b!=NULL){ cnt+=a->val+b->val,a->val=cnt...

2023-03-06

0 233