题目描述：Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating lette...
分类：
其他好文 时间：
2014-10-09 02:29:17
阅读次数：
178
如需转帖，请写明出处http://blog.csdn.net/slimboy123/archive/2009/07/30/4394782.aspx今天我同事在用mysql的时候，需要对一个字符串中的指定内容进行截取，如 现有字符串 "[]aseabcd[12345]ddxabcdsx[]"，要截取"...
分类：
数据库 时间：
2014-10-09 00:36:17
阅读次数：
324
[问题描述]Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioni...
分类：
其他好文 时间：
2014-10-07 01:23:32
阅读次数：
341
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given[100, 4, 200, 1, 3, 2],The longest ...
分类：
其他好文 时间：
2014-10-07 01:22:02
阅读次数：
270
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...
分类：
其他好文 时间：
2014-10-07 00:32:12
阅读次数：
237
谋事在人，成事在天[问题描述]Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.F...
分类：
其他好文 时间：
2014-10-07 00:28:22
阅读次数：
232
leetcode 经典题Minimum Window Substring ，很巧妙算法。...
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
...
分类：
其他好文 时间：
2014-10-06 16:08:40
阅读次数：
181
You are given a string,S, and a list of words,L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenati...
分类：
其他好文 时间：
2014-10-06 14:58:50
阅读次数：
148
【leetcode】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....
分类：
其他好文 时间：
2014-10-06 12:12:00
阅读次数：
149
