你说夕阳很美

分类

题解(152)

/ 注册

全部文章（共153篇）

题解 | #合并二叉树#

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

C++

2021-11-21

0 313

题解 | #合并二叉树#

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

C++

2021-11-21

0 368

题解 | #判断t1树中是否有与t2树完全相同的子树#

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

C++

2021-11-20

0 340

题解 | #调整数组顺序使奇数位于偶数前面(一)#

class Solution { public: /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * * @param array int整型vector * @return int整型vecto...

C++

2021-11-20

0 349

题解 | #二叉树的镜像#

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

C++

2021-11-19

0 330

题解 | #通配符匹配#

class Solution { public: bool isMatch(const char *s, const char *p) { string S = s; string P = p; vector<vector<bool...

C++

2021-11-19

0 390

题解 | #买卖股票的最好时机(二)#

class Solution { public: /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * 计算最大收益 * @param prices int整型vector 股票每一天的价格 * @return in...

C++

2021-11-18

0 355

题解 | #把数字翻译成字符串#

class Solution { public: /** * 解码 * @param nums string字符串数字串 * @return int整型 */ int solve(string nums) { // write...

C++

2021-11-16

0 377

题解 | #子数组最大乘积#

class Solution { public: double maxProduct(vector<double> arr) { int n = arr.size(); if(arr.size() < 1) retur...

C++

2021-11-15

0 371

题解 | #把二叉树打印成多行#

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

C++

2021-11-15

0 372