摘要:
1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(i...
阅读全文
posted @ 2015-03-24 17:30
keepshuatishuati
阅读(114)
推荐(0)
编辑
摘要:
1 class Solution { 2 public: 3 int numTrees(int n) { 4 if (n dp(n+1, 0); 6 dp[0] = 1; 7 dp[1] = 1; 8 for (int i ...
阅读全文
posted @ 2015-03-24 17:27
keepshuatishuati
阅读(111)
推荐(0)
编辑
摘要:
1 class TwoSum { 2 private: 3 unordered_map record; 4 public: 5 void add(int number) { 6 record[number]++; 7 } 8 9 bool find...
阅读全文
posted @ 2015-03-24 17:24
keepshuatishuati
阅读(123)
推荐(0)
编辑
摘要:
Here's the one I mentioned before. It comes as sorted array. 1 class Solution { 2 public: 3 vector twoSum(vector &numbers, int target) { 4 ...
阅读全文
posted @ 2015-03-24 17:21
keepshuatishuati
阅读(144)
推荐(0)
编辑
摘要:
For two sum, we can sort the array and scan from two ends.Then space O(1), time O(nlogn)For here, it only accepts index. So we cant sort it as the ind...
阅读全文
posted @ 2015-03-24 17:19
keepshuatishuati
阅读(123)
推荐(0)
编辑
摘要:
1 class Solution { 2 public: 3 int minimumTotal(vector > &triangle) { 4 int len = triangle.size(); 5 for (int i = len-2; i >= 0; ...
阅读全文
posted @ 2015-03-24 17:12
keepshuatishuati
阅读(115)
推荐(0)
编辑
摘要:
Scanning from left to right and right to left.Find the max height of left and right. The minimum one will be most possible height for current state th...
阅读全文
posted @ 2015-03-24 17:06
keepshuatishuati
阅读(131)
推荐(0)
编辑