leecode
littlexidong
这个作者很懒,什么都没留下…
展开
-
Palindrome Partitioning
http://oj.leetcode.com/problems/palindrome-partitioning/ bool is_hw(int i, int j, string s, vector>& table) { if (table[i][j] != 0) { return table[i][j] > 0; } if (s[i] != s[j]) {原创 2013-09-24 10:35:02 · 609 阅读 · 0 评论 -
Palindrome Partitioning II
http://oj.leetcode.com/problems/palindrome-partitioning-ii/int minCut(string s) { int ret = 0; int s_len =s.size(); if (s_len <= 1) { return 0; } // s[0] ~ s[i] needs cuts; vector原创 2013-09-24 10:36:38 · 702 阅读 · 0 评论 -
Sum Root to Leaf Numbers
http://oj.leetcode.com/problems/sum-root-to-leaf-numbers/ struct TreeNode { int val; TreeNode* left; TreeNode* right; TreeNode(int x): val(x), left(NULL), right(NULL) { }};void get_nu原创 2013-09-24 17:34:42 · 572 阅读 · 0 评论 -
Surrounded Regions
http://oj.leetcode.com/problems/surrounded-regions/void mark(vector>& board, int x, int y) { int h = board.size(); int w = board[0].size(); if (board[y][x] == 'o') { board[y][x] = 's';原创 2013-09-24 17:00:36 · 669 阅读 · 0 评论 -
Longest Consecutive Sequence
http://oj.leetcode.com/problems/longest-consecutive-sequence/ void find_longest_consequence(void) { vector v; v.push_back(100); v.push_back(4); v.push_back(200); v.push_back(200); v.pu原创 2013-09-24 19:25:18 · 535 阅读 · 0 评论