|
|||
|
摘要：
排好序的...中间是root , root左边是left,root右边是right递归建树./** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: TreeNode* createTree(vector&num , int start , in... 阅读全文
posted @ 2013-12-31 19:58 1957 阅读(185) 评论(0) 推荐(0) 编辑
摘要：
递推,滚动数组class Solution {public: vector getRow(int rowIndex) { vector > f(2 , vector(rowIndex+1 , 0)); int mark = 0; f[mark][0] = 1;f[mark][1] = 1; // 1 mark ++ ; mark %= 2; for(int i = 1 ; i < rowIndex ; i++){ f[mark][0] = 1; f[mark][i + 1]... 阅读全文
posted @ 2013-12-31 19:30 1957 阅读(296) 评论(0) 推荐(0) 编辑
摘要：
枚举开始位置,DFS验证const int dx[] = {0,0,1,-1};const int dy[] = {1,-1,0,0};class Solution {public: unordered_set flag; bool check(vector > & board , string& word , int x , int y , int pos){ if(pos == word.size()) return true; for(int i = 0 ; i = 0 && tx = 0 && ty > &board, 阅读全文
posted @ 2013-12-31 16:08 1957 阅读(217) 评论(0) 推荐(0) 编辑
摘要：
从任意两个节点之间最大的一条路径.../** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: int ans; int search(TreeNode* root){ if(root == nullptr) return 0... 阅读全文
posted @ 2013-12-31 15:38 1957 阅读(162) 评论(0) 推荐(0) 编辑 |
|||
