上一页 1 ··· 23 24 25 26 27 28 29 30 31 ··· 36 下一页
摘要: Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon... 阅读全文
posted @ 2014-11-28 06:36 LiBlog 阅读(138) 评论(0) 推荐(0) 编辑
摘要: Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers.... 阅读全文
posted @ 2014-11-28 06:12 LiBlog 阅读(147) 评论(0) 推荐(0) 编辑
摘要: Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of ... 阅读全文
posted @ 2014-11-28 05:32 LiBlog 阅读(138) 评论(0) 推荐(0) 编辑
摘要: Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpo... 阅读全文
posted @ 2014-11-28 04:44 LiBlog 阅读(120) 评论(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 @ 2014-11-28 02:02 LiBlog 阅读(138) 评论(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 @ 2014-11-28 01:45 LiBlog 阅读(120) 评论(0) 推荐(0) 编辑
摘要: 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 @ 2014-11-28 00:56 LiBlog 阅读(138) 评论(0) 推荐(0) 编辑
摘要: 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 longes... 阅读全文
posted @ 2014-11-27 06:46 LiBlog 阅读(136) 评论(0) 推荐(0) 编辑
摘要: Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.NOTE: the return is the list of all a... 阅读全文
posted @ 2014-11-27 06:12 LiBlog 阅读(137) 评论(0) 推荐(0) 编辑
摘要: Implement pow(x, n).Analysis:x^n = x^(n/2)*x^(n/2) (*x, if n is odd).NOTE: We need consider n0) 8 res = powRecur(x,n); 9 else{10 ... 阅读全文
posted @ 2014-11-27 04:58 LiBlog 阅读(147) 评论(0) 推荐(0) 编辑
上一页 1 ··· 23 24 25 26 27 28 29 30 31 ··· 36 下一页