2015年6月8日
摘要: Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from the orig... 阅读全文
posted @ 2015-06-08 00:21 gone~with~wind 阅读(118) 评论(0) 推荐(0)
  2015年6月7日
摘要: Given a stringsand a dictionary of wordsdict, add spaces insto construct a sentence where each word is a valid dictionary word.Return all such possibl... 阅读全文
posted @ 2015-06-07 23:01 gone~with~wind 阅读(114) 评论(0) 推荐(0)
摘要: Given a stringsand a dictionary of wordsdict, determine ifscan be segmented into a space-separated sequence of one or more dictionary words.For exampl... 阅读全文
posted @ 2015-06-07 21:40 gone~with~wind 阅读(106) 评论(0) 推荐(0)
摘要: Implement regular expression matching with support for'.'and'*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The... 阅读全文
posted @ 2015-06-07 19:39 gone~with~wind 阅读(144) 评论(0) 推荐(0)
  2015年6月6日
摘要: Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given"25525511135",return["255.2... 阅读全文
posted @ 2015-06-06 10:51 gone~with~wind 阅读(131) 评论(0) 推荐(0)
摘要: Write a function to find the longest common prefix string amongst an array of strings.求最长公共前缀:以第一个字符串为模板比较之后的字符串即可。 1 public class Solution { 2 pu... 阅读全文
posted @ 2015-06-06 10:12 gone~with~wind 阅读(104) 评论(0) 推荐(0)
摘要: Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo... 阅读全文
posted @ 2015-06-06 09:52 gone~with~wind 阅读(133) 评论(0) 推荐(0)
  2015年6月5日
摘要: You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ... 阅读全文
posted @ 2015-06-05 20:57 gone~with~wind 阅读(115) 评论(0) 推荐(0)
摘要: Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two nu... 阅读全文
posted @ 2015-06-05 17:13 gone~with~wind 阅读(109) 评论(0) 推荐(0)