leetcode
文章平均质量分 72
耀凯考前突击大师
路漫漫其修远兮,吾将上下而求索。
展开
-
[Leetcode刷题总结系列][Dynamic programming]198. House Robber
Leetcode 198. House RobberYou are a professional robber who is planing to rob houses along a street. Each house has a certain amount of money stashed, the only constraint that stopping you from robbing each of them is that adjacent house has security syst原创 2016-04-25 09:40:34 · 549 阅读 · 0 评论 -
Leetcode282. Expression Add Operators
AnalysisOveiously, in order to solve this question, we have to iterate through all of the possible cases at least once. DFS can be used to solve the iteration process. The optimization we could made it原创 2017-09-20 10:05:46 · 483 阅读 · 0 评论 -
LeetCode677. Map Sum Pairs
LeetCode677. Map Sum Pairs原创 2017-09-28 16:14:37 · 475 阅读 · 0 评论 -
Leetcode407. Trapping Rain Water II
Leetcode407. Trapping Rain Water II原创 2017-09-21 03:53:16 · 490 阅读 · 0 评论 -
LeetCode678. Valid Parenthesis String
678. Valid Parenthesis String原创 2017-09-29 13:21:21 · 698 阅读 · 0 评论 -
LeetCode670. Maximum Swap
670. Maximum Swap原创 2017-10-18 13:42:10 · 399 阅读 · 0 评论 -
LeetCode543. Diameter of Binary Tree
Leetcode543. Diameter of Binary Tree原创 2017-10-09 15:34:10 · 464 阅读 · 0 评论 -
LeetCode681. Next Closest Time
681. Next Closest Time原创 2017-10-01 06:25:31 · 1648 阅读 · 0 评论 -
LeetCode673. Number of Longest Increasing Subsequence
673. Number of Longest Increasing Subsequence原创 2017-10-02 05:01:53 · 719 阅读 · 0 评论 -
LeetCode341. Flatten Nested List Iterator
LeetCode341. Flatten Nested List Iterator原创 2017-10-10 16:10:18 · 586 阅读 · 0 评论 -
LeetCode653. Two Sum IV - Input is a BST
Leetcode 653. Two Sum IV - Input is a BST原创 2017-10-04 15:43:54 · 519 阅读 · 0 评论 -
LeetCode636. Exclusive Time of Functions
636. Exclusive Time of Functions原创 2017-10-13 16:37:25 · 465 阅读 · 0 评论 -
LeetCode689. Maximum Sum of 3 Non-Overlapping Subarrays
LeetCode689. Maximum Sum of 3 Non-Overlapping Subarrays原创 2017-10-16 13:27:00 · 2027 阅读 · 0 评论 -
LeetCode238. Product of Array Except Self
238. Product of Array Except Self原创 2017-10-25 15:49:23 · 335 阅读 · 0 评论 -
LeetCode148. Sort List
LeetCode148. Sort List原创 2017-09-25 11:44:28 · 316 阅读 · 0 评论 -
Amazon面试题 实现有符号整数的二进制表示法
实现有符号整数的二进制表示法。或者说,实现java.lang.Integer.toBinaryString()方法。要想实现有符号整数的二进制表示法,我们首先需要知道有符号整数在计算机中是怎么存储的。计算机中存储有符号整数,使用的是补码(two’s complement)。正数的补码同原码(其二进制表示)相同。负数的补码是其绝对值的原码按位取反(反码,one’s complement)后再加一。因原创 2017-08-07 07:28:08 · 835 阅读 · 0 评论 -
[Leetcode]617. Merge Two Binary Trees
[Leetcode]617. Merge Two Binary Trees原创 2017-06-18 11:00:51 · 1498 阅读 · 0 评论 -
[Leetcode刷题总结系列][Dynamic Programming]62. Unique Paths
Leetcode Dynamic Programming62. Unique PathsA robot is located at the top-left corner of a m*n grid.The robot only moves either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid.How many unique paths原创 2016-05-02 04:59:13 · 649 阅读 · 0 评论 -
[Leetcode刷题总结系列][Dynamic programming][Divide-and-conquer]53.Maximum Subarray
leetcode 53.Maximum SubarrayFind a continguous subarray within an array (containing at least one number) which has the largest sum.找到一个数组中一个连续相加之和最大的子数组。原创 2016-04-29 08:59:40 · 1059 阅读 · 0 评论 -
[Leetcode刷题总结系列][Dynamic Programming]63. Unique Paths II
Unique Paths IIFollow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?leetcode第63题原创 2016-05-20 15:28:41 · 614 阅读 · 0 评论 -
[leetcode]114. Flatten Binary Tree to Linked List
题目链接:114. Flatten Binary Tree to Linked List Given a binary tree, flatten it to a linked list in-place. Hints: If you notice carefully in the flattened tree, each node’s right child points to the ne原创 2016-06-12 17:40:52 · 630 阅读 · 0 评论 -
[leetcode]111.Minimum Depth of Binary Tree
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 node.题目链接:111原创 2016-05-31 16:23:30 · 637 阅读 · 0 评论 -
[leetcode]189. Rotate Array
题目链接:189. Rotate Array Rotate 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]. Hints: Could you do it in-p原创 2016-07-01 03:55:18 · 424 阅读 · 0 评论 -
[leetcode]95. Unique Binary Search Trees II
题目链接:95. Unique Binary Search Trees IIGiven an integer n, generate all structurally unique BST’s (binary search trees) that store values 1…n.原创 2016-07-13 15:09:15 · 540 阅读 · 0 评论 -
[leetcode] 310.Minimum Height Trees
leetcode 310.Minimum Height Trees原创 2016-07-28 06:13:31 · 631 阅读 · 0 评论 -
[LeetCode]321. Create Maximum Number
参见Github. 321. Create Maximum Number原创 2016-10-25 14:30:22 · 390 阅读 · 0 评论 -
[Leetcode]153. Find Minimum in Rotated Sorted Array
leetcode 153. Find Minimum in Rotated Sorted Array原创 2017-02-20 11:30:34 · 505 阅读 · 0 评论 -
Quick Select Algorithm 快速选择算法
什么是Quick select?Quick select算法通常用来在未排序的数组中寻找第k小/第k大的元素。其方法类似于Quick sort。Quick select和Quick sort都是由Tony Hoare发明的,因此Quick select算法也被称为是Hoare's selection algorithm。原创 2017-03-31 04:38:32 · 25752 阅读 · 2 评论 -
[Leetcode刷题总结系列][Dynamic programming] 121. Best time to buy and sell stock
Leetcode 121. Best time to buy and sell stock原创 2016-04-24 08:36:49 · 1247 阅读 · 0 评论 -
[Leetcode][Dynamic programming] 121. Best time to buy and sell stock
Leetcode 121. Best time to buy and sell stock. Dynamic Programming原创 2017-04-06 02:43:37 · 524 阅读 · 0 评论 -
LeetCode650. 2 Keys Keyboard
LeetCode650. 2 Keys Keyboard原创 2017-11-20 12:47:02 · 449 阅读 · 0 评论