|
|||
|
摘要：
简单DFS/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: void dfs(TreeNode* root , int sum , vector >& ans , vector& tmp) { if(root == null... 阅读全文
posted @ 2014-01-14 22:05 1957 阅读(160) 评论(0) 推荐(0) 编辑
摘要：
按Largest Rectangle in Histogram的方法做每行求一次max每次更新的height就是当前列到0行那列0的个数（包含当前行然后用height来求largest rectangleclass Solution {public: void getLeft(const vector& h , vector& l) { int size = h.size(); for(int i = 1 ; i 0 && h[i] & h, vector& r) { int size = h.size(); for(int i ... 阅读全文
posted @ 2014-01-14 20:31 1957 阅读(789) 评论(0) 推荐(0) 编辑
摘要：
递归删除- -/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode *deleteDuplicates(ListNode *head) { if(head == nullptr || head -> next == nullptr) return head; ... 阅读全文
posted @ 2014-01-14 18:44 1957 阅读(230) 评论(0) 推荐(0) 编辑
摘要：
和上一题同理,不过root在postorder的最后/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: template TreeNode* make(Iter iFirst , Iter iLast , Iter pFirst , ... 阅读全文
posted @ 2014-01-14 18:05 1957 阅读(205) 评论(0) 推荐(0) 编辑
摘要：
从前序中序遍历来重构二叉树经典题,从期末考试到考研什么的应该都有前序遍历第一个肯定是root在inorder里面去找root左边的是leftsubtree , 右边的是rightsubtree然后preorder除去order,后面lifetsubtree.size 个是左边的, rightsubtree.size个是右边的递归构造tree就好了/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNod... 阅读全文
posted @ 2014-01-14 17:20 1957 阅读(2632) 评论(0) 推荐(0) 编辑 |
|||
