Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, "A man, a plan, a canal: Pan...
分类：
其他好文 时间：
2014-08-01 22:31:42
阅读次数：
208
题目：Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: ....
分类：
编程语言 时间：
2014-08-01 10:27:11
阅读次数：
310
Longest Substring Without Repeating CharactersGiven a string, find the length of the longest substring without repeating characters. For example, the ...
分类：
其他好文 时间：
2014-07-31 23:46:00
阅读次数：
256
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring
without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo...
分类：
其他好文 时间：
2014-07-29 14:28:48
阅读次数：
218
syntaxsyntax 英 ['s?ntæks] 美 ['s?ntæks] n. 语法；句法；有秩序的排列specified 英 ['spesifaid] 美adj. 规定的；详细说明的v. 指定；详细说明（specify的过去分词）characters 英 美 ['kær?k...
分类：
其他好文 时间：
2014-07-29 12:18:56
阅读次数：
183
1 public class Solution { 2 public static int lengthOfLongestSubstring(String s) { 3 4 char[] arr = s.toCharArray(); 5 int pre = 0; 6 ...
题目：Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBE....
分类：
编程语言 时间：
2014-07-28 14:42:23
阅读次数：
264
题目：Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.If the last w....
分类：
编程语言 时间：
2014-07-28 11:35:00
阅读次数：
250
题目：Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letter....
分类：
编程语言 时间：
2014-07-28 11:34:30
阅读次数：
265
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类：
其他好文 时间：
2014-07-27 10:25:42
阅读次数：
179
