leetcode oj 解题报告
飞哥是个行动pie
这个作者很懒,什么都没留下…
展开
-
LeetCode Two Sum
Two Sum Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up原创 2015-01-24 18:50:25 · 329 阅读 · 0 评论 -
LeetCode 3Sum
3SumGiven 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.Note:El原创 2015-02-04 20:13:25 · 324 阅读 · 0 评论 -
LeetCode Rotate Image
Rotate ImageYou are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?class Solution {public:原创 2015-02-04 20:11:07 · 366 阅读 · 0 评论 -
LeetCode Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.c原创 2015-01-18 20:05:28 · 368 阅读 · 0 评论 -
LeetCode Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.class Solution {pub原创 2015-01-19 17:05:27 · 398 阅读 · 0 评论 -
LeetCode Pascal's Triangle & Pascal's Triangle II
Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]class Solution {public:原创 2015-01-19 20:11:46 · 403 阅读 · 0 评论 -
LeetCode Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements fro原创 2015-01-20 17:42:46 · 345 阅读 · 0 评论 -
[旧版] LeetCode 3Sum Closest
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 may assume that each input would have exact原创 2014-12-10 22:45:50 · 369 阅读 · 0 评论 -
[旧版] LeetCode Insert Interval
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.E原创 2014-12-10 12:14:47 · 379 阅读 · 0 评论 -
[旧版] LeetCode Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, whe原创 2014-12-09 21:29:15 · 365 阅读 · 0 评论 -
LeetCode Search in Rotated Sorted Array
Search in Rotated Sorted ArraySuppose a sorted array 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 targe原创 2015-01-29 23:42:23 · 324 阅读 · 0 评论 -
LeetCode Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with原创 2015-01-18 21:14:16 · 315 阅读 · 0 评论 -
LeetCode Set Matrix Zeroes
Set Matrix Zeroes Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.Follow up:Did you use extra space?A straight forward solution using O(m原创 2015-01-26 21:04:45 · 381 阅读 · 0 评论 -
LeetCode Container With Most Water
Container With Most WaterGiven 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 endpoints of line原创 2015-01-26 19:46:42 · 349 阅读 · 0 评论 -
LeetCode Search Insert Position
Search Insert PositionGiven 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原创 2015-01-29 20:48:05 · 296 阅读 · 0 评论 -
LeetCode Unique Paths
Unique PathsA 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 r原创 2015-01-29 21:28:07 · 318 阅读 · 0 评论 -
LeetCode Majority Element
Majority Element原创 2015-01-22 17:13:59 · 407 阅读 · 0 评论 -
LeetCode 3Sum Closest
3Sum ClosestGiven 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 may assume that e原创 2015-01-24 19:47:46 · 355 阅读 · 0 评论 -
LeetCode Search for a Range
Search for a RangeGiven 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 order of O(log原创 2015-02-02 19:46:00 · 278 阅读 · 0 评论 -
LeetCode Search in Rotated Sorted Array II
Search in Rotated Sorted Array IIFollow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function t原创 2015-02-02 19:43:34 · 346 阅读 · 0 评论 -
LeetCode Search a 2D Matrix
Search a 2D MatrixWrite 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 sorted from left原创 2015-02-02 19:50:38 · 359 阅读 · 0 评论 -
LeetCode ZigZag Conversion
ZigZag ConversionThe string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P原创 2015-02-06 13:07:53 · 330 阅读 · 0 评论