LeetCode
文章平均质量分 62
linjiafengyang
一个正在学习的青年
展开
-
LeetCode 42. Trapping Rain Water
LeetCode 42. Trapping Rain WaterDescription: Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining...原创 2018-02-23 21:53:09 · 157 阅读 · 0 评论 -
LeetCode 112. Path Sum
这里写链接内容Description: Given 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.Example: For example: Giv原创 2017-12-19 08:45:40 · 125 阅读 · 0 评论 -
LeetCode 109. Convert Sorted List to Binary Search Tree
LeetCode 109. Convert Sorted List to Binary Search TreeDescription: Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem原创 2017-12-18 20:58:31 · 146 阅读 · 0 评论 -
LeetCode 108. Convert Sorted Array to Binary Search Tree
LeetCode 108. Convert Sorted Array to Binary Search TreeDescription: Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-原创 2017-12-18 15:39:35 · 115 阅读 · 0 评论 -
LeetCode 111. Minimum Depth of Binary Tree
LeetCode Minimum Depth of Binary TreeDescription: Given 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 nea原创 2017-12-18 14:31:37 · 110 阅读 · 0 评论 -
LeetCode 110. Balanced Binary Tree
LeetCode 110. Balanced Binary TreeDescription: Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the d原创 2017-12-18 14:19:26 · 119 阅读 · 0 评论 -
LeetCode 278. First Bad Version
LeetCode 278. First Bad VersionDescription: You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check.原创 2018-01-01 16:27:22 · 183 阅读 · 0 评论 -
LeetCode 69. Sqrt(x)
LeetCode 69. Sqrt(x)Description: Implement int sqrt(int x). Compute and return the square root of x. x is guaranteed to be a non-negative integer.Example 1: Input: 4 Output: 2Example原创 2018-01-01 16:06:30 · 123 阅读 · 0 评论 -
LeetCode 104. Maximum Depth of Binary Tree
LeetCode 104. Maximum Depth of Binary TreeDescription: Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down t原创 2017-12-18 09:42:09 · 120 阅读 · 0 评论 -
LeetCode 198. House Robber
LeetCode 198. House RobberDescription: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob原创 2017-12-25 19:31:05 · 148 阅读 · 0 评论 -
LeetCode 101. Symmetric Tree
LeetCode 101. Symmetric TreeDescription: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).Example 1: For example, this binary tree [1,2,2,3,4,4,3] is s原创 2017-12-16 21:14:37 · 158 阅读 · 0 评论 -
LeetCode 100.Same Tree
LeetCode 100.Same TreeDescription: Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical and原创 2017-12-16 19:28:57 · 140 阅读 · 0 评论 -
LeetCode 746. Min Cost Climbing Stairs
LeetCode 746. Min Cost Climbing StairsDescription: On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two s原创 2017-12-25 16:01:17 · 286 阅读 · 0 评论 -
LeetCode 70. Climbing Stairs
LeetCode 70. Climbing StairsDescription: You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb原创 2017-12-25 14:44:05 · 192 阅读 · 0 评论 -
LeetCode 35. Search Insert Position
LeetCode 35. Search Insert PositionDescription: Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in ord原创 2017-12-14 23:31:23 · 128 阅读 · 0 评论 -
LeetCode 113. Path Sum II
LeetCode 113. Path Sum IIDescription: Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.Example: For example: Given the below binary tree and原创 2017-12-19 09:24:00 · 130 阅读 · 0 评论 -
LeetCode 55. Jump Game
LeetCode 55. Jump GameDescription: Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump l原创 2018-01-12 20:28:59 · 180 阅读 · 0 评论 -
LeetCode 34. Search for a Range
LeetCode 34. Search for a RangeDescription: Given an array of integers sorted in ascending order, find the starting and ending position of a given target value. Your algorithm’s runtime com...原创 2018-02-08 13:27:34 · 153 阅读 · 0 评论 -
LeetCode 33. Search in Rotated Sorted Array
LeetCode 33. Search in Rotated Sorted ArrayDescription: Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 ...原创 2018-02-08 13:06:31 · 150 阅读 · 0 评论 -
LeetCode 31.NextPermutation
LeetCode 31.NextPermutationDescription: Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possi原创 2018-02-07 21:35:20 · 176 阅读 · 0 评论 -
LeetCode 41. First Missing Positive
LeetCode 41. First Missing PositiveDescription: Given an unsorted integer array, find the first missing positive integer. Your algorithm should run in O(n) time and uses constant space.Exa...原创 2018-02-08 21:35:10 · 133 阅读 · 0 评论 -
LeetCode 39. Combination Sum and LeetCode 40. Combination Sum II
LeetCode 39. Combination SumDescription: Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums t...原创 2018-02-08 20:36:17 · 153 阅读 · 0 评论 -
LeetCode 18. 4Sum
LeetCode 18. 4SumDescription: Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the su原创 2018-01-31 16:50:18 · 185 阅读 · 0 评论 -
LeetCode 16. 3Sum Closest
LeetCode 16. 3Sum ClosestDescription: 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. You m原创 2018-01-31 16:33:57 · 128 阅读 · 0 评论 -
LeetCode 15. 3Sum
LeetCode 15. 3SumDescription: 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 zero. Not原创 2018-01-31 15:59:49 · 169 阅读 · 0 评论 -
LeetCode 4. Median of Two Sorted Arrays
LeetCode 4. Median of Two Sorted ArraysDescription: There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time原创 2018-01-31 15:24:31 · 136 阅读 · 0 评论 -
LeetCode 11. Container With Most Water
LeetCode 11. Container With Most WaterDescription: 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原创 2018-01-31 14:35:53 · 131 阅读 · 0 评论 -
LeetCode 240. Search a 2D Matrix II
LeetCode 240. Search a 2D Matrix IIDescription: Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row原创 2018-01-12 21:44:37 · 154 阅读 · 0 评论 -
LeetCode 74. Search a 2D Matrix
LeetCode 74. Search a 2D MatrixDescription: Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are原创 2018-01-12 21:23:17 · 112 阅读 · 0 评论 -
LeetCode 63. Unique Paths II
LeetCode 63. Unique Paths IIDescription: Follow up for “Unique Paths”: Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empt原创 2018-01-12 21:11:09 · 114 阅读 · 0 评论 -
LeetCode 62. Unique Paths
LeetCode 62. Unique PathsDescription: A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below). The robot can only move either down or right at any po原创 2018-01-12 20:55:39 · 144 阅读 · 0 评论 -
LeetCode 88. Merge Sorted Array
LeetCode 88. Merge Sorted ArrayDescription: Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: You may assume that nums1 has enough space (size t原创 2017-12-14 20:45:33 · 111 阅读 · 0 评论 -
LeetCode 119. Pascal's Triangle II
LeetCode 119. Pascal’s Triangle IIDescription: Given an index k, return the kth row of the Pascal’s triangle. For example, given k = 3, Return [1,3,3,1].分析: 可以在118题修改一下,返回res[rowIndex]即可。具原创 2017-12-14 19:54:56 · 121 阅读 · 0 评论 -
LeetCode 628. Maximum Product of Three Numbers
LeetCode 628. Maximum Product of Three NumbersDescription: Given an integer array, find three numbers whose product is maximum and output the maximum product.Example 1: Input: [1,2,3] Output: 6原创 2017-11-18 23:26:35 · 163 阅读 · 0 评论 -
LeetCode 152.Maximum Product Subarray
LeetCode 152.Maximum Product SubarrayDescription: Find the contiguous subarray within an array (containing at least one number) which has the largest product.Example: For example, given the array原创 2017-11-18 23:24:28 · 160 阅读 · 0 评论 -
LeetCode 673.Number of Longest Increasing Subsequence
LeetCode 673.Number of Longest Increasing SubsequenceDescription: Given an unsorted array of integers, find the number of longest increasing subsequence.Example 1: Input: [1,3,5,4,7] Output: 2原创 2017-11-04 19:09:02 · 308 阅读 · 0 评论 -
LeetCode 674.Longest Continuous Increasing Subsequence
LeetCode 674.Longest Continuous Increasing SubsequenceDescription: Given an unsorted array of integers, find the length of longest continuous increasing subsequence.Example 1: Input: [1,3,5,4,7]原创 2017-11-04 16:42:56 · 169 阅读 · 0 评论 -
LeetCode 643.Maximum Average Subarray 最大子数组的平均值
LeetCode 643.Maximum Average Subarray 最大子数组平均值Description: Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need to原创 2017-11-13 20:58:12 · 394 阅读 · 0 评论 -
LeetCode 697. Degree of an Array
LeetCode 697. Degree of an Array Given a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements.原创 2017-10-26 10:06:49 · 379 阅读 · 0 评论 -
LeetCode 14.Longest Common Prefix
LeetCode 14.Longest Common Prefix Write a function to find the longest common prefix string amongst an array of strings. Difficulty:Easy分析: 这道题比较简单,只需要两层循环简单判断就可得到结果。先以第一个字符串作为初始结果,后面的字符串与之比较原创 2017-10-22 00:05:50 · 163 阅读 · 0 评论