摘要：
Problem StatementGiven a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindr... 阅读全文
posted @ 2014-11-22 12:02
kid551
阅读(125)
评论(0)
推荐(0)
摘要：
My naive $O(n^2)$ running time solution:class Solution {public: int jump(int A[], int n) { if(1 == n) return 0; int maxL = (1= (i-j) ... 阅读全文
posted @ 2014-11-22 01:32
kid551
阅读(157)
评论(0)
推荐(0)
摘要：
Problem StatementGiven an unsorted array of integers, find the length of the longest consecutive elements sequence.For example, Given [100, 4, 200, 1,... 阅读全文
posted @ 2014-11-22 01:05
kid551
阅读(153)
评论(0)
推荐(0)
摘要：
Loop List is very common in interview. This article we give a more strict shortstatement about its solving.One method to check if there's a loop in a ... 阅读全文
posted @ 2014-11-22 00:49
kid551
阅读(291)
评论(0)
推荐(0)
浙公网安备 33010602011771号