摘要: ```C++ class Solution { public: void recur(TreeNode* root, const int expectNumber, int curr, vector>& res, vector& path){ path.push_back(root->val); curr += root->val; bool... 阅读全文
posted @ 2018-09-02 20:27 一条图图犬 阅读(93) 评论(0) 推荐(0) 编辑
摘要: ```C++ class Solution { public: bool IsPopOrder(vector pushV,vector popV) { if(pushV.empty() || popV.empty() || pushV.size() != popV.size()) return fa 阅读全文
posted @ 2018-09-02 19:59 一条图图犬 阅读(254) 评论(0) 推荐(0) 编辑