辛巴爱喝星巴克

分类

题解(4)

/ 注册

全部文章（共4篇）

前序遍历递归

class Solution {public: vector<vector<int> > FindPath(TreeNode* root, int expectNumber) { vector<vector<int> > res; ...

2020-03-06

0 665

充分利用弹出顺序

class Solution {public: bool IsPopOrder(vector<int> pushV, vector<int> popV) { stack<int> r; int id = 0; for...

2020-03-06

0 512

更优雅更简单更优的解法

只需将两个树前序遍历，然后判断是否为字串class Solution {public: bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2) { if(pRoot2==NULL) return false; string...

2020-03-06

0 361

冒泡排序

class Solution {public: void reOrderArray(vector<int> &array) { for (int i = 0; i < array.size(); i++) { for ...

2020-03-04

0 370