上一页 1 ··· 14 15 16 17 18 19 20 21 22 ··· 32 下一页
摘要: ``` class Solution { public: bool wordBreak(string s, vector& wordDict) { unordered_set wordSet(wordDict.begin(), wordDict.end()); vector dp(s.size() 阅读全文
posted @ 2019-04-10 10:23 JohnRed 阅读(120) 评论(0) 推荐(0)
摘要: ``` class Solution { public: RandomListNode *copyRandomList(RandomListNode *head) { if (!head) return NULL; RandomListNode *res = new RandomListNode(head->label); RandomLis... 阅读全文
posted @ 2019-04-10 09:57 JohnRed 阅读(77) 评论(0) 推荐(0)
摘要: ``` class Solution { public: int singleNumber(vector& nums) { int res = 0; for (int i = 0; i i) & 1; } res |= (sum % 3) & nums) { int one = 0, two = 0 阅读全文
posted @ 2019-04-10 09:52 JohnRed 阅读(93) 评论(0) 推荐(0)
摘要: ``` class Solution { public: int singleNumber(int A[], int n) { //异或 int elem = 0; for(int i = 0; i 阅读全文
posted @ 2019-04-10 09:49 JohnRed 阅读(105) 评论(0) 推荐(0)
摘要: ``` class Solution { public: int candy(vector& ratings) { int res = 0, n = ratings.size(); vector nums(n, 1); for (int i = 0; i ratings[i]) nums[i + 1] = nums[i] + 1; ... 阅读全文
posted @ 2019-04-10 09:41 JohnRed 阅读(89) 评论(0) 推荐(0)
摘要: ``` class Solution { public: int canCompleteCircuit(vector& gas, vector& cost) { int total = 0, sum = 0, start = 0; for (int i = 0; i 阅读全文
posted @ 2019-04-10 09:40 JohnRed 阅读(99) 评论(0) 推荐(0)
摘要: ``` class Solution { public: Node* cloneGraph(Node* node) { unordered_map m; return helper(node, m); } Node* helper(Node* node, unordered_map& m) { if (!node) retur... 阅读全文
posted @ 2019-04-10 09:39 JohnRed 阅读(67) 评论(0) 推荐(0)
摘要: ``` class Solution { public: int minCut(string s) { if (s.empty()) return 0; int n = s.size(); vector p(n, vector(n)); vector dp(n); for (int i = 0; i 阅读全文
posted @ 2019-04-10 09:37 JohnRed 阅读(52) 评论(0) 推荐(0)
摘要: ``` class Solution { public: vector partition(string s) { int n = s.size(); vector res; vector out; vector dp(n, vector(n)); for (int i = 0; i & dp, v 阅读全文
posted @ 2019-04-10 09:36 JohnRed 阅读(71) 评论(0) 推荐(0)
摘要: ``` class Solution { public: void solve(vector & board) { if (board.empty() || board[0].empty()) return; int m = board.size(), n = board[0].size(); fo 阅读全文
posted @ 2019-04-10 09:34 JohnRed 阅读(81) 评论(0) 推荐(0)
上一页 1 ··· 14 15 16 17 18 19 20 21 22 ··· 32 下一页