LeetCode
文章平均质量分 68
SimonCode
change yourself,change the world
展开
-
LeetCode刷题【Array】 Maximum Average Subarray I
【题目】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 output the maximum average value.Example 1:原创 2017-07-19 09:45:20 · 394 阅读 · 0 评论 -
LeetCode刷题【Array】 Maximum Subarray
题目:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],the contiguous subarray [4,-原创 2017-03-16 16:03:09 · 233 阅读 · 0 评论 -
LeetCode刷题【Array】 Two Sum II - Input array is sorted
题目:Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the t原创 2017-03-16 14:44:16 · 310 阅读 · 0 评论 -
LeetCode刷题【Array】 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].Note:Try to come up as many soluti原创 2017-03-16 13:19:19 · 211 阅读 · 0 评论 -
LeetCode刷题【Array】 K-diff Pairs in an Array
题目:Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i, j), where i and j are both原创 2017-03-16 10:04:48 · 438 阅读 · 0 评论 -
LeetCode刷题【Array】Best Time to Buy and Sell Stock II
题目:Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i原创 2017-03-15 15:57:57 · 241 阅读 · 0 评论 -
LeetCode刷题【Array】 Best Time to Buy and Sell Stock
题目:Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of th原创 2017-03-15 10:08:10 · 280 阅读 · 0 评论 -
LeetCode刷题【Array】Third Maximum Number
题目:Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).Example 1:Inpu原创 2017-03-15 00:07:40 · 229 阅读 · 0 评论 -
LeetCode刷题【Array】 Combination Sum II
题目:Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in th原创 2017-03-30 14:50:09 · 299 阅读 · 0 评论 -
LeetCode刷题【Array】Search Insert Position
题目: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 order.You may assume no duplicates in t原创 2017-03-13 22:03:46 · 244 阅读 · 0 评论 -
LeetCode刷题【Array】 Spiral Matrix II
题目:Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9原创 2017-03-23 16:14:38 · 324 阅读 · 0 评论 -
LeetCode刷题【Array】 Max Consecutive Ones
题目:Given a binary array, find the maximum number of consecutive 1s in this array.Example 1:Input: [1,1,0,1,1,1]Output: 3Explanation: The first two digits or the last three digits are c原创 2017-03-16 16:52:28 · 257 阅读 · 0 评论 -
LeetCode刷题【Array】 Missing Number
题目:Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.For example,Given nums = [0, 1, 3] return 2.Note:Your algori原创 2017-03-15 16:42:20 · 246 阅读 · 0 评论 -
LeetCode刷题【Array】 Maximum Product of Three Numbers
【题目】Given an integer array, find three numbers whose product is maximum and output the maximum product.Example 1:Input: [1,2,3]Output: 6Example 2:Input: [1,2,3,4]Output: 2原创 2017-07-18 11:42:59 · 290 阅读 · 0 评论 -
LeetCode刷题【Array】 Find Minimum in Rotated Sorted Array
【题目】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 5 6 7 0 1 2).Find the minimum element.You may assume原创 2017-07-21 16:07:28 · 378 阅读 · 0 评论 -
LeetCode刷题【Array】 Shortest Unsorted Continuous Subarray
【题目】 Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too.You原创 2017-07-18 10:26:59 · 565 阅读 · 0 评论 -
LeetCode刷题【Array】Minimum Size Subarray Sum
【题目】Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead.For example,原创 2017-07-20 13:02:54 · 343 阅读 · 0 评论 -
LeetCode刷题【Array】 Can Place Flowers
【题目】Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would原创 2017-07-14 08:40:06 · 439 阅读 · 0 评论 -
LeetCode刷题【Array】 Next Permutation
题目:Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest p原创 2017-04-06 09:43:56 · 342 阅读 · 0 评论 -
LeetCode刷题【Array】 Find the Duplicate Number
题目:Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate n原创 2017-03-17 13:31:18 · 301 阅读 · 0 评论 -
LeetCode刷题【Array】 Contains Duplicate II
题目:Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j]and the absolute difference between i and j is原创 2017-03-16 23:58:34 · 261 阅读 · 0 评论 -
LeetCode刷题【Array】 Two Sum
题目:Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not us原创 2017-03-16 23:24:47 · 234 阅读 · 0 评论 -
LeetCode刷题【Array】 Find All Numbers Disappeared in an Array
题目:Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements of [1, n] inclusive that do not appear in this a原创 2017-03-16 23:06:04 · 216 阅读 · 0 评论 -
LeetCode刷题【Array】 Spiral Matrix
题目:Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9原创 2017-03-23 15:57:37 · 280 阅读 · 0 评论 -
LeetCode刷题【Array】 Unique Paths II
题目: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 empty space is marked as 1 and 0 respectively原创 2017-03-23 15:20:52 · 307 阅读 · 0 评论 -
LeetCode刷题【Array】 Unique Paths
题目: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 point in time. The robot is trying to r原创 2017-03-22 17:25:34 · 241 阅读 · 0 评论 -
LeetCode刷题【Array】 Merge Intervals
题目:Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].解决方法:Runtime: 97 ms/** * Definition fo原创 2017-03-28 09:21:25 · 283 阅读 · 0 评论 -
LeetCode刷题【Array】 Remove Duplicates from Sorted Array II
题目:Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the原创 2017-03-20 17:34:09 · 195 阅读 · 0 评论 -
LeetCode刷题【Array】Merge Sorted Array
题目: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 that is greater or equal to m + n) to h原创 2017-03-10 17:04:50 · 283 阅读 · 0 评论 -
LeetCode刷题【Array】 Search in Rotated Sorted Array II
题目:Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Suppose an array sorted in ascending order is原创 2017-03-20 15:47:45 · 298 阅读 · 0 评论 -
LeetCode刷题【Array】 Search in Rotated Sorted Array
题目: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 5 6 7 0 1 2).You are given a target value to search原创 2017-03-20 14:53:38 · 258 阅读 · 0 评论 -
LeetCode刷题【Array】 Game of Life
题目:According to the Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970."Given a boar原创 2017-03-20 10:40:57 · 346 阅读 · 0 评论 -
LeetCode刷题【Array】 Subsets II
题目:Given a collection of integers that might contain duplicates, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,原创 2017-03-18 17:55:47 · 272 阅读 · 0 评论 -
LeetCode刷题【Array】 Subsets
题目:Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,3], a solution is:[ [3原创 2017-03-18 17:33:31 · 408 阅读 · 0 评论 -
LeetCode刷题【Array】 Construct Binary Tree from Preorder and Inorder Traversal
题目:Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.解决方法:Runtime: 7 ms/** * Definition for a原创 2017-03-18 15:35:05 · 265 阅读 · 0 评论 -
LeetCode刷题【Array】 Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.解决方法一:Runtime: 22 ms/** * Definition for a binary原创 2017-03-17 23:34:46 · 248 阅读 · 0 评论 -
LeetCode刷题【Array】 Word Search
题目:Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or v原创 2017-03-21 10:38:38 · 235 阅读 · 0 评论 -
LeetCode刷题【Array】 Product of Array Except Self
题目:Given 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 ofnums except nums[i].Solve it without division原创 2017-03-21 11:26:17 · 257 阅读 · 0 评论 -
LeetCode刷题【Array】 Combination Sum
题目:iven a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be原创 2017-03-29 16:41:37 · 465 阅读 · 0 评论 -
LeetCode刷题【Array】 Sort Colors
题目:Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the原创 2017-03-29 14:16:58 · 288 阅读 · 0 评论