码迷,mamicode.com
首页 >  
搜索关键字:characters    ( 2378个结果
LeetCode: Combinations [077]
【题目】 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 = "ADOBECODEBANC" T = "ABC" Minimum window is "BANC". Note: If there is no such window in S that covers ...
分类:其他好文   时间:2014-06-05 11:14:26    阅读次数:255
LeetCode: Minimum Window Substring [076]
【题目】 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 = "ADOBECODEBANC" T = "ABC" Minimum window is "BANC". Note: If there is no such window in S that covers ...
分类:Windows程序   时间:2014-06-05 10:03:07    阅读次数:473
Minimum Window Substring
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="ADOBECODEBA...
分类:Windows程序   时间:2014-06-04 19:07:31    阅读次数:385
SAX解析XML的过程
SAX解析XML的过程SAX解析XML的过程:---------------------------一行一行的读,触发事件。(这个XML文档没有加载到内存中)第一步:当遇到元素的开始标记的时候执行startElement方法第二步:接着执行characters方法第三步:当遇到元素的结束标记的时候执...
分类:其他好文   时间:2014-05-31 11:22:15    阅读次数:188
LeetCode: Longest Substring Without Repeating Characters 题解
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类:其他好文   时间:2014-05-30 23:46:09    阅读次数:453
Valid Palindrome
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Pana...
分类:其他好文   时间:2014-05-30 16:24:31    阅读次数:222
leetcode -day21 Longest Substring Without Repeating Characters
?? 1、Longest Substring Without Repeating Characters Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letter...
分类:其他好文   时间:2014-05-26 05:03:19    阅读次数:172
LeetCode: Length of Last Word [057]
【题目】 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 word does not exist, return 0. Note: A word is defined as a character sequence consists of non-space ...
分类:其他好文   时间:2014-05-25 07:39:05    阅读次数:256
LeetCode: Minimum Window Substring
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 = "ADOBECOD...
分类:Windows程序   时间:2014-05-24 11:19:26    阅读次数:399
LeetCode: Wildcard Matching [043]
【题目】 Implement wildcard pattern matching with support for '?' and '*'. '?' Matches any single character. '*' Matches any sequence of characters (including the empty sequence). The matching should cover the entire input string (not partial). The functi...
分类:其他好文   时间:2014-05-23 00:17:12    阅读次数:364
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!