acm-字符串
文章平均质量分 74
maverick1990
这个作者很懒,什么都没留下…
展开
-
Google Code jam 2013 Round 1C A题
类型:字符串 难度:1.5 ProblemIn English, there are 26 letters that are either vowels or consonants. In this problem, we consider a, e, i, o, and u to be vowels, and the other 21 letters to be consonan原创 2013-05-12 22:27:02 · 1014 阅读 · 0 评论 -
leetcode-Distinct Subsequences
Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original string by deleting some (can be non原创 2014-07-06 16:18:56 · 760 阅读 · 0 评论 -
字符串匹配的KMP算法
字符串匹配是计算机的基本任务之一。举例来说,有一个字符串"BBC ABCDAB ABCDABCDABDE",我想知道,里面是否包含另一个字符串"ABCDABD"?许多算法可以完成这个任务,Knuth-Morris-Pratt算法(简称KMP)是最常用的之一。它以三个发明者命名,起头的那个K就是著名科学家Donald Knuth。这种算法不太容易理解,网上转载 2014-07-07 13:47:08 · 682 阅读 · 0 评论 -
leetcode-Word Break II
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Return all such possible sentences.For example, givens = "原创 2014-07-22 23:53:16 · 786 阅读 · 0 评论 -
leetcode-Substring with Concatenation of All Words
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 concatenation of each word in L exactly once and without an原创 2014-07-20 18:18:00 · 971 阅读 · 0 评论 -
leetcode-Simplify Path
Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"click to show corner cases.Corner Cases:Did原创 2014-04-09 16:01:04 · 3162 阅读 · 0 评论 -
leetcode-Regular Expression Matching
Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire input st转载 2014-03-21 15:00:55 · 804 阅读 · 0 评论 -
leetcode-String to Integer (atoi)
mplement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cas原创 2014-03-20 17:23:17 · 730 阅读 · 0 评论 -
leetcode-ZigZag Conversion
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I原创 2014-03-19 23:35:19 · 1174 阅读 · 0 评论 -
leetcode-Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.题意:寻找一个字符串的最原创 2014-03-19 22:04:32 · 926 阅读 · 0 评论 -
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 3. Fo原创 2014-03-18 16:11:58 · 663 阅读 · 0 评论 -
leetcode-Valid Number
Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguo原创 2014-03-27 20:35:14 · 865 阅读 · 0 评论 -
TopCoder SRM 597 Div1 第1题
Problem Statement Little Elephant from the Zoo of Lviv likes strings. You are given a string A and a string B of the same length. In one turn Little Elephant can choose any charac原创 2013-11-25 23:33:34 · 1047 阅读 · 0 评论 -
Google中国2014校园招聘笔试Round B China New Grad Test Problem E. Ignore all my comments
ProblemGood programmers write fabulous comments. Igor is a programmer and he likes the old C-style comments in /* ... */ blocks. For him, it would be ideal if he could use this style as a uniform原创 2013-10-18 13:47:23 · 2305 阅读 · 0 评论 -
浅谈manacher算法-O(n)时间内寻找最大回文子串
manacher算法是我在网上无意中找到的,主要是用来求某个字符串的最长回文子串.不过网上的版本还不太成熟,我就修改了下.不要被manacher这个名字吓倒了,其实manacher算法很简单,也很容易理解,程序短,时间复杂度为O(n).求最长回文子串这个问题,我听说有个分治+拓展kmp的算法,不过我估计后缀数组也可以.但杀鸡岂能用牛刀?现在进入正题:首先,在字符串s中,转载 2014-03-19 21:53:25 · 1029 阅读 · 0 评论