摘要：
``` class Solution { public: int sumNumbers(TreeNode* root) { return sumNumbersDFS(root, 0); } int sumNumbersDFS(TreeNode* root, int sum) { if (!root) return 0; sum... 阅读全文
posted @ 2019-04-09 16:15
JohnRed
阅读(65)
评论(0)
推荐(0)
摘要：
``` class Solution { public: int longestConsecutive(vector& nums) { int res = 0; unordered_set s(nums.begin(), nums.end()); for (int val : nums) { if (!s.count(... 阅读全文
posted @ 2019-04-09 16:05
JohnRed
阅读(86)
评论(0)
推荐(0)
摘要：
``` class Solution { public: typedef unordered_set::iterator HashIter; vector findLadders(string start, string end, unordered_set &dict) { // Note: Th 阅读全文
posted @ 2019-04-09 15:35
JohnRed
阅读(76)
评论(0)
推荐(0)
摘要：
``` class Solution { public: int ladderLength(string start, string end, unordered_set &dict) { // IMPORTANT: Please reset any member data you declared 阅读全文
posted @ 2019-04-09 15:35
JohnRed
阅读(172)
评论(0)
推荐(0)
摘要：
``` class Solution { public: bool isPalindrome(string s) { int left = 0, right = s.size() 1 ; while (left = 'a' && ch = 'A' && ch = '0' && ch 阅读全文
posted @ 2019-04-09 15:32
JohnRed
阅读(107)
评论(0)
推荐(0)
摘要：
```
class Solution {
public: int maxPathSum(TreeNode* root) { int res = INT_MIN; helper(root, res); return res; } int helper(TreeNode* node, int& res) { if ... 阅读全文
posted @ 2019-04-09 15:30
JohnRed
阅读(86)
评论(0)
推荐(0)
摘要：
``` class Solution { public: int maxProfit(vector &prices) { if (prices.empty()) return 0; int n = prices.size(), g[n][3] = {0}, l[n][3] = {0}; for (i 阅读全文
posted @ 2019-04-09 15:28
JohnRed
阅读(65)
评论(0)
推荐(0)
摘要：
``` class Solution { public: int maxProfit(vector& prices) { int res = 0, n = prices.size(); for (int i = 0; i 阅读全文
posted @ 2019-04-09 15:26
JohnRed
阅读(94)
评论(0)
推荐(0)
摘要：
``` class Solution { public: int maxProfit(vector& prices) { int n = prices.size(); if (n==0){ return 0; } int res = 0; int mmin = prices[0]; for (int 阅读全文
posted @ 2019-04-09 15:25
JohnRed
阅读(77)
评论(0)
推荐(0)
摘要：
``` class Solution { public: int minimumTotal(vector & triangle) { vector dp(triangle.back()); for (int i = (int)triangle.size() 2; i = 0; i) { for (i 阅读全文
posted @ 2019-04-09 15:24
JohnRed
阅读(77)
评论(0)
推荐(0)
浙公网安备 33010602011771号