码迷,mamicode.com
首页 >  
搜索关键字:valid characters    ( 4838个结果
Valid Parentheses
典型的用栈(stack)结构解决问题的例子class Solution: def isPair(self,s1,s2): if (s1=='(' and s2==')')or (s2=='(' and s1==')'): return True ...
分类:其他好文   时间:2014-10-27 14:17:47    阅读次数:186
LeetCode: Valid Parentheses 解题报告
Valid Parentheses Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets m...
分类:其他好文   时间:2014-10-26 22:31:27    阅读次数:438
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 = "ADOBECODEBANC" T = "ABC" Minimum window is "BAN...
分类:Windows程序   时间:2014-10-26 18:31:18    阅读次数:300
leetcode - Text Justification
Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified. You should pack your words in a greedy approach; that i...
分类:其他好文   时间:2014-10-26 17:05:25    阅读次数:175
LeetCode Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the correct order, "()" and "()[]{}" are all val...
分类:其他好文   时间:2014-10-26 17:02:49    阅读次数:142
mybatis 3 -枚举
定义枚举:public static enum AppStateEnum { Valid("有效"), Virtual("虚拟"), Hide("隐藏"); public String toString() { return this.app...
分类:其他好文   时间:2014-10-26 15:36:19    阅读次数:131
[Leetcode] Length of Last Word
Given a stringsconsists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word doe...
分类:其他好文   时间:2014-10-26 14:18:54    阅读次数:158
leetcode - Wildcard Matching
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 t...
分类:其他好文   时间:2014-10-26 13:08:38    阅读次数:172
【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 for "abcabcbb" is "abc", which the length is...
分类:其他好文   时间:2014-10-26 11:49:53    阅读次数:203
leetcode - Longest Valid Parentheses
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. For "(()", the longest valid parentheses substring is "()", ...
分类:其他好文   时间:2014-10-26 11:49:43    阅读次数:185
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!