摘要：
class Solution { public: bool isPalindrome(string s) { int i = 0, j = s.length() - 1; while (i < j) { if (!isalnum(s[i])) i++; else if (!is... 阅读全文
posted @ 2018-05-20 14:16
JTechRoad
阅读(71)
评论(0)
推荐(0)
摘要：
class Solution { public: int maxProfit(vector& prices) { if (prices.size() == 0) return 0; int res = 0, _min = prices[0]; for (auto p : prices) { if (p < _min)... 阅读全文
posted @ 2018-05-20 14:09
JTechRoad
阅读(86)
评论(0)
推荐(0)
摘要：
/** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *right, *next; * TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL)... 阅读全文
posted @ 2018-05-20 13:43
JTechRoad
阅读(104)
评论(0)
推荐(0)
摘要：
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla... 阅读全文
posted @ 2018-05-20 13:08
JTechRoad
阅读(86)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/decode-ways/description/ 阅读全文
posted @ 2018-05-20 12:52
JTechRoad
阅读(186)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/subsets-ii/description/ 阅读全文
posted @ 2018-05-20 07:28
JTechRoad
阅读(75)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/maximal-rectangle/description/ 阅读全文
posted @ 2018-05-20 04:32
JTechRoad
阅读(102)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/word-search/description/ 阅读全文
posted @ 2018-05-19 15:14
JTechRoad
阅读(104)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/subsets/description/ 阅读全文
posted @ 2018-05-19 14:49
JTechRoad
阅读(84)
评论(0)
推荐(0)
摘要：
https://leetcode.com/problems/minimum-window-substring/description/ 阅读全文
posted @ 2018-05-19 14:44
JTechRoad
阅读(66)
评论(0)
推荐(0)
浙公网安备 33010602011771号