Algorithm.subString
jzbgld
这个作者很懒,什么都没留下…
展开
-
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.原创 2014-09-19 15:31:46 · 460 阅读 · 0 评论 -
判断一个整数是否回文整数,不用辅助数组!
题目:Determine whether an integer is a palindrome. Do this without extra space.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of converting the integer to原创 2014-09-24 15:27:25 · 600 阅读 · 0 评论 -
Edit Distance
Edit Distance编辑距离说明转载 2015-05-04 16:47:08 · 306 阅读 · 0 评论 -
Distinct Subsequences
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 deleti翻译 2015-06-01 19:55:08 · 362 阅读 · 0 评论