题目Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.代码/**
* Definition for binary tree
* p...
分类：
其他好文 时间：
2015-03-04 17:08:21
阅读次数：
118
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类：
其他好文 时间：
2015-03-04 09:44:51
阅读次数：
122
Assume s is a string of lower case characters.
Write a program that prints the longest substring of s in which the letters occur in alphabetical order. For example, if s = 'azcbobobegghakl', then y...
分类：
编程语言 时间：
2015-03-03 22:17:49
阅读次数：
805
最长回文子串动态规划的方法的参考Palindrome Partitioning （回文子串题）代码：class Solution {public: string longestPalindrome(string s) { int n=s.size(); int dp...
分类：
其他好文 时间：
2015-03-03 20:39:26
阅读次数：
105
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv...
分类：
其他好文 时间：
2015-03-03 18:34:37
阅读次数：
132
Assume s is a string of lower case characters.Write a program that prints the longest substring of s in which the letters occur in alphabetical order....
分类：
编程语言 时间：
2015-03-03 18:11:29
阅读次数：
376
[LeetCode] 014. Longest Common Prefix (Easy) (C++/Java/Python)...
分类：
编程语言 时间：
2015-03-03 16:46:23
阅读次数：
141
Maximum repetition substringTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7578Accepted: 2281DescriptionThe repetition number of a string is...
分类：
编程语言 时间：
2015-03-03 06:18:08
阅读次数：
327
题目Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.For example, given s = “aab”,
Return 1 sinc...
分类：
其他好文 时间：
2015-03-02 23:58:14
阅读次数：
368
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类：
其他好文 时间：
2015-03-02 23:48:30
阅读次数：
157
