keepshuatishuati - 博客园

2015年3月25日

摘要： Logic is tricky. Redo it. 1 class Solution { 2 public: 3 bool isNumber(string s) { 4 int start = 0, end = s.size()-1; 5 if (end ==... 阅读全文

posted @ 2015-03-25 05:11 keepshuatishuati 阅读(148) 评论(0) 推荐(0)

LeetCode – Refresh – Unique Paths II

摘要： We can use a matrix do the dp. Or we can use an array to record it.But when we encounter 1, we set it to be 0. 1 class Solution { 2 public: 3 int ... 阅读全文

posted @ 2015-03-25 04:54 keepshuatishuati 阅读(135) 评论(0) 推荐(0)

LeetCode – Refresh – Unique Paths

摘要： 1 class Solution { 2 public: 3 int uniquePaths(int m, int n) { 4 vector dp(m, 1); 5 for (int i = 1; i < n; i++) { 6 f... 阅读全文

posted @ 2015-03-25 04:47 keepshuatishuati 阅读(143) 评论(0) 推荐(0)

2015年3月24日

LeetCode – Refresh – Unique Binary Search Tree II

摘要： 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 阅读(118) 评论(0) 推荐(0)

LeetCode – Refresh – Unique Binary Search Tree

摘要： 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 阅读(116) 评论(0) 推荐(0)

LeetCode – Refresh – Two Sum III

摘要： 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 阅读(127) 评论(0) 推荐(0)

LeetCode – Refresh – Two Sum II

摘要： 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 阅读(147) 评论(0) 推荐(0)

LeetCode – Refresh – Two Sum

摘要： 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 阅读(129) 评论(0) 推荐(0)

LeetCode – Refresh – Triangle

摘要： 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 阅读(121) 评论(0) 推荐(0)

LeetCode – Refresh – Trapping Rain Water

摘要： 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 阅读(134) 评论(0) 推荐(0)