- 博客(18)
- 收藏
- 关注
RSS订阅转载 [LeetCode]2. Add Two Numbers&67. Add Binary
2. Add Two Numbers67. Add Binary
2016-10-16 13:48:32
434
转载 [LeetCode]409. Longest Palindrome
EasyGiven a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.This is case sensitive, for example “Aa” is not cons
2016-10-07 00:25:07
354
转载 [LeetCode]39.Combination Sum&40.Combination Sum II&216.Combination Sum III&377.Combination Sum IV
39.Combination Sum40.Combination Sum II216.Combination Sum III377.Combination Sum IV
2016-10-06 23:44:30
433
转载 [LeetCode]223. Rectangle Area
Easy Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Rectangle Area Assume that
2016-10-05 23:53:38
251
转载 [LeetCode]400. Nth Digit
EasyFind the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, …Note: n is positive and will fit within the range of a 32-bit signed integer (n < 231).Example 1:Input: 3Ou
2016-10-05 21:26:59
252
转载 [LeetCode]38. Count and Say
EasyThe count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, …1 is read off as “one 1” or 11. 11 is read off as “two 1s” or 21. 21 is read off as “one 2,
2016-10-05 20:23:41
212
转载 [LeetCode]7. Reverse Integer&190. Reverse Bits
7. Reverse Integer190. Reverse Bits
2016-10-05 17:04:24
229
转载 [LeetCode]189. Rotate Array
EasyRotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note: Try to come up as many solutions as you can,
2016-10-05 15:55:24
236
转载 [LeetCode]343. Integer Break
MediumGiven a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, re
2016-10-05 10:11:07
222
转载 [LeetCode]144. Binary Tree Preorder Traversal&94. Binary Tree Inorder Traversal
144. Binary Tree Preorder Traversal94. Binary Tree Inorder Traversal
2016-10-04 23:27:44
231
转载 [LeetCode]318. Maximum Product of Word Lengths
MediumGiven a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case
2016-10-04 16:58:01
286
转载 [LeetCode]238. Product of Array Except Self
MediumGiven an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O(n)
2016-10-04 16:27:34
195
转载 [LeetCode]204. Count Primes
EasyDescription:Count the number of prime numbers less than a non-negative number, n.超时： public int countPrimes(int n) { int[] primes = new int[n/2+1]; int p = 0; int i = 2;
2016-10-04 10:06:19
248
转载 [LeetCode]58. Length of Last Word
EasyGiven 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 define
2016-10-03 17:34:10
218
转载 [LeetCode]257. Binary Tree Paths
EasyGiven a binary tree, return all root-to-leaf paths.For example, given the following binary tree:1 / \ 2 3 \ 5 All root-to-leaf paths are:[“1->2->5”, “1->3”]5ms:public List<String> bi
2016-10-01 16:24:53
237
转载 [LeetCode]118. Pascal's Triangle&119. Pascal's Triangle II
118. Pascal's Triangle119. Pascal's Triangle II
2016-10-01 15:53:39
240
转载 [LeetCode]112. Path Sum&113. Path Sum II
112 . Path Sum EasyGiven a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example: Given the below bin
2016-10-01 12:16:35
277
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人