LeetCode - 随笔分类(第7页) - zengzy

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].主要是考虑几种情况：1.起点... 阅读全文

posted @ 2015-11-29 22:45 zengzy 阅读(185) 评论(0) 推荐(0)

Search a 2D Matrix

摘要：Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted from l... 阅读全文

posted @ 2015-11-29 21:55 zengzy 阅读(159) 评论(0) 推荐(0)

Trapping Rain Water

摘要：Givennnon-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.Fo... 阅读全文

posted @ 2015-11-29 20:02 zengzy 阅读(144) 评论(0) 推荐(0)

Best Time to Buy and Sell Stock III

摘要：Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文

posted @ 2015-11-29 15:01 zengzy 阅读(189) 评论(0) 推荐(0)

Best Time to Buy and Sell Stock II

摘要：Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文

posted @ 2015-11-29 12:17 zengzy 阅读(140) 评论(0) 推荐(0)

Best Time to Buy and Sell Stock

摘要：Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie... 阅读全文

posted @ 2015-11-29 11:18 zengzy 阅读(170) 评论(0) 推荐(0)

Longest Consecutive Sequence

摘要：Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given[100, 4, 200, 1, 3, 2],The longest ... 阅读全文

posted @ 2015-11-29 11:03 zengzy 阅读(139) 评论(0) 推荐(0)

Find Peak Element

摘要：A peak element is an element that is greater than its neighbors.Given an input array wherenum[i] ≠ num[i+1], find a peak element and return its index.... 阅读全文

posted @ 2015-11-29 02:00 zengzy 阅读(133) 评论(0) 推荐(0)

Valid Palindrome

摘要：Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Pana... 阅读全文

posted @ 2015-11-29 00:11 zengzy 阅读(165) 评论(0) 推荐(0)

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,... 阅读全文

posted @ 2015-11-28 23:54 zengzy 阅读(154) 评论(0) 推荐(0)

Minimum Path Sum

摘要：Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:Yo... 阅读全文

posted @ 2015-11-28 23:43 zengzy 阅读(166) 评论(0) 推荐(0)

Find the Duplicate Number

摘要：Given an arraynumscontainingn+ 1 integers where each integer is between 1 andn(inclusive), prove that at least one duplicate number must exist. Assume... 阅读全文

posted @ 2015-11-28 23:18 zengzy 阅读(159) 评论(0) 推荐(0)

Missing Number, First Missing Positive

摘要：268. 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, 阅读全文

posted @ 2015-11-28 18:32 zengzy 阅读(195) 评论(0) 推荐(0)

Product of Array Except Self

摘要：Given an array ofnintegers wheren> 1,nums, return an arrayoutputsuch thatoutput[i]is equal to the product of all the elements ofnumsexceptnums[i].Solv... 阅读全文

posted @ 2015-11-28 17:37 zengzy 阅读(166) 评论(0) 推荐(0)

Maximum Product Subarray

摘要：Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],the... 阅读全文

posted @ 2015-11-28 12:22 zengzy 阅读(167) 评论(0) 推荐(0)

Search for a Range

摘要：Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the ord... 阅读全文

posted @ 2015-11-28 11:33 zengzy 阅读(186) 评论(0) 推荐(0)

First Bad Version

摘要：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 c... 阅读全文

posted @ 2015-11-28 11:21 zengzy 阅读(141) 评论(0) 推荐(0)

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 or... 阅读全文

posted @ 2015-11-28 11:11 zengzy 阅读(133) 评论(0) 推荐(0)

Add Digits

摘要：Given a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process is like:3 + ... 阅读全文

posted @ 2015-11-28 10:53 zengzy 阅读(143) 评论(0) 推荐(0)

Happy Number

摘要：Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer... 阅读全文

posted @ 2015-11-28 10:37 zengzy 阅读(180) 评论(0) 推荐(0)

随笔分类 - LeetCode

公告