- 博客(19)
- 收藏
- 关注
原创 Leetcode no. 8
8. 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 yo
2016-06-26 00:12:29 271
原创 Leetcode no. 162
162. Find Peak ElementA peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.The array
2016-06-25 22:51:35 320
原创 Leetcode no. 168
168. Excel Sheet Column TitleGiven a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 ->
2016-06-24 15:26:16 370
原创 Leetcode no. 171
171. Excel Sheet Column NumberRelated to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A
2016-06-24 15:10:14 259
原创 Leetcode no. 172
172. Factorial Trailing ZeroesGiven an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.public class Solution {
2016-06-24 14:51:19 310
原创 Leetcode no. 338
338. Counting BitsGiven a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an arr
2016-06-24 14:14:13 298
原创 Leetcode no. 347
347. Top K Frequent ElementsGiven a non-empty array of integers, return the k most frequent elements.For example,Given [1,1,1,2,2,3] and k = 2, return [1,2].Note: You may ass
2016-06-24 13:50:27 439 1
原创 Leetcode no. 72
72. Edit DistanceGiven two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 oper
2016-06-23 11:18:46 276
原创 Leetcode no. 91
91. Decode WaysA message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits,
2016-06-22 11:17:53 301
原创 Leetcode no. 38
38. Count and SayThe 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"
2016-06-22 00:44:29 223
原创 Leetcode no. 237
237. Delete Node in a Linked ListWrite a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4
2016-06-21 21:55:12 247
原创 Leetcode no. 236
236. Lowest Common Ancestor of a Binary TreeGiven a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “Th
2016-06-20 23:35:04 516
原创 Leetcode no. 111
111. Minimum Depth of Binary TreeGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf
2016-06-18 21:18:50 289
原创 Leetcode no. 107
107. Binary Tree Level Order Traversal IIGiven a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
2016-06-18 20:32:42 363
原创 Leetcode no. 102
102. Binary Tree Level Order TraversalGiven a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree
2016-06-18 00:55:31 265
原创 Leetcode no. 124
124. Binary Tree Maximum Path SumGiven a binary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tr
2016-06-18 00:37:32 317
原创 Leetcode no. 136
136. Single NumberGiven an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you im
2016-06-06 11:45:00 247
原创 Leetcode no. 306
306. Additive NumberAdditive number is a string whose digits can form additive sequence.A valid additive sequence should contain at least three numbers. Except for the first two numbers,
2016-06-01 17:15:52 349
原创 Leetcode no. 258
258. Add DigitsGiven a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1
2016-06-01 00:51:54 260
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人