2015年08月_饭没了吃

09月 08月 07月 06月 05月 04月

原创 Group Anagrams

Given an array of strings, return all groups of strings that are anagrams. Note: All inputs will be in lower-case.

2015-08-31 12:13:39 329

原创 Valid Number

Validate if a given string is numeric. Some examples: “0” => true ” 0.1 ” => true “abc” => false “1 a” => false “2e10” => true Note: It is intended for the problem statement to be ambiguous. You

2015-08-30 15:35:51 234

原创 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 th

2015-08-30 14:29:38 160

原创 Length of Last Word

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 defin

2015-08-27 22:24:00 209

原创 Simplify Path

Given an absolute path for a file (Unix-style), simplify it. For example, path = “/home/”, => “/home” path = “/a/./b/../../c/”, => “/c” Corner Cases: • Did you consider the case where path = “/../

2015-08-27 22:23:37 240

原创 Roman to Integer

Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.

2015-08-27 22:22:23 228

原创 Integer to Roman

Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.

2015-08-27 22:21:52 238

原创 Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings.

2015-08-27 22:20:59 279

原创 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 str

2015-08-27 22:20:00 274

原创 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.

2015-08-27 22:19:12 557

原创 Add Binary

Given two binary strings, return their sum (also a binary string). For example, a = “11” b = “1” Return ”100”.

2015-08-27 22:18:28 277

原创 String to Integer (atoi)

Implement 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 case

2015-08-27 22:17:15 292

原创 Implement strStr()

Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack. 题意：实现strstr(). 返回needle(关键字)在haystack(字符串)中第一次出现的位置，如果needle不在haystac

2015-08-27 22:13:41 248

原创 Remove Element

Given an array and a value, remove all instances of that value in place and return the new length. The order of elements can be changed. It doesn’t matter what you leave beyond the new length. 分析：给你一

2015-08-13 20:55:31 299