LeetCode解题报告
文章平均质量分 62
caishenfans
这个作者很懒,什么都没留下…
展开
-
LeetCode 55.Jump Game
题目: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 length at that position.De原创 2015-03-11 18:39:13 · 447 阅读 · 0 评论 -
LeetCode 28.Implement strStr()
题目:Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Update (2014-11-02):The signature of the function had bee原创 2015-02-12 22:20:26 · 388 阅读 · 0 评论 -
LeetCode 5.Longest Palindromic Substring
题目:Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.分析与解答:求字符原创 2015-02-01 23:24:37 · 353 阅读 · 0 评论 -
LeetCode 25.Reverse Nodes in k-Group
题目:Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain原创 2015-02-12 15:37:01 · 324 阅读 · 0 评论 -
LeetCode 23.Merge k Sorted Lists
题目:Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.分析与解答:合并K个有序链表。既然前面有了合并2个链表的程序,毫无疑问此题用分治法解,两两合并,就是类似于归并排序,复杂度是O(n*logn)。/** * Definiti原创 2015-02-11 14:15:27 · 398 阅读 · 0 评论 -
LeetCode 19.Remove Nth Node From End of List
题目:Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the原创 2015-02-10 15:30:21 · 282 阅读 · 0 评论 -
LeetCode 41.First Missing Positive
题目:Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses原创 2015-02-25 00:26:40 · 337 阅读 · 0 评论 -
LeetCode 47.Permutations II
题目:Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[1,1,2], [1,2,1], and原创 2015-02-26 01:17:14 · 350 阅读 · 0 评论 -
LeetCode 40.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原创 2015-02-24 21:06:33 · 359 阅读 · 0 评论 -
LeetCode 46.Permutations
题目:Given a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].分析与解答:原创 2015-02-25 23:46:55 · 423 阅读 · 0 评论 -
LeetCode 42.Trapping Rain Water
题目: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.For example, Given [0,1,0,2,1,0,1,3原创 2015-02-25 17:13:30 · 512 阅读 · 0 评论 -
LeetCode 20.Valid Parentheses
题目:Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are原创 2015-02-10 16:41:20 · 333 阅读 · 0 评论 -
LeetCode 29.Divide Two Integers
题目:Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.分析与解答:不能用乘法,所以只能用位运算了。利用类似于二分法,比如被除数是48,除数是7,用除数每次乘以2,7*2 = 14, 14 *2 = 2原创 2015-02-13 16:23:13 · 325 阅读 · 0 评论 -
LeetCode 26.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 p原创 2015-02-10 21:32:46 · 275 阅读 · 0 评论 -
LeetCode 64.Minimum Path Sum
题目:Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or原创 2015-03-17 21:12:34 · 438 阅读 · 0 评论 -
LeetCode 63.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原创 2015-03-17 19:58:34 · 438 阅读 · 0 评论 -
LeetCode 62.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原创 2015-03-17 19:57:44 · 408 阅读 · 0 评论 -
LeetCode 69.Sqrt(x)
题目:Implement int sqrt(int x).Compute and return the square root of x.分析与解答:更快的方法是牛顿法,这里采用二分法也是可以的。class Solution {public: int sqrt(int x) { if(x == 0){ return 0;原创 2015-03-17 21:17:29 · 541 阅读 · 0 评论 -
LeetCode 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,−1,2,原创 2015-03-09 13:48:00 · 344 阅读 · 0 评论 -
LeetCode 31.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原创 2015-03-17 15:14:38 · 398 阅读 · 0 评论 -
LeetCode 52.N-Queens II
题目:Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.分析与解答:比上一题更简单了class Solution{ public: int原创 2015-03-08 21:39:50 · 337 阅读 · 0 评论 -
LeetCode 51.N-Queens
题目:The n-queens puzzle is the problem of placing n queens on ann×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzz原创 2015-03-08 20:02:11 · 365 阅读 · 0 评论 -
LeetCode 56.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].分析与解答:先排序,然后遍历,在遍历的过程中合并。/** * Def原创 2015-03-16 15:13:24 · 657 阅读 · 0 评论 -
LeetCode 76.Minimum Window Substring
题目:Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T = "ABC"Minimum windo原创 2015-03-19 21:43:40 · 515 阅读 · 0 评论 -
LeetCode 30.Substring with Concatenation of All Words
题目:You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and原创 2015-02-15 22:58:48 · 506 阅读 · 0 评论 -
LeetCode 21.Merge Two Sorted Lists
题目:Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.分析与解答:合并两个有序链表为一个链表。利用两个指针即可,注意的是当一个链表到头时后面直接链原创 2015-02-10 18:13:20 · 311 阅读 · 0 评论 -
LeetCode 2.Add Two Numbers
题目:You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it原创 2015-01-22 18:12:34 · 477 阅读 · 0 评论 -
LeetCode 17.Letter Combinations of a Phone Number
题目:Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input原创 2015-02-09 15:08:46 · 348 阅读 · 0 评论 -
LeetCode 38.Count and Say
题目:The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is rea原创 2015-02-22 14:09:43 · 375 阅读 · 0 评论 -
LeetCode 37.Sudoku Solver
题目:Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution.原创 2015-02-22 12:24:24 · 483 阅读 · 0 评论 -
LeetCode 33.Search in Rotated Sorted Array
题目:Suppose 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 target value to search. If found in the ar原创 2015-02-16 22:48:58 · 360 阅读 · 0 评论 -
LeetCode 16.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 hav原创 2015-02-04 22:14:51 · 365 阅读 · 0 评论 -
LeetCode 15.3Sum
题目: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.Note:Elements in a tripl原创 2015-02-04 21:09:12 · 709 阅读 · 0 评论 -
LeetCode 9.Palindrome Number
题目:Determine whether an integer is a palindrome. Do this without extra space.判断一个整形数字是不是回文。附加条件是不能用额外空间。分析与解答:如果没有附加条件,那么一个容易实现的做法是将数字每次除以10,余数依次存入数组,再从头和尾部依次检查看是否相等。复杂度O(n)。不能用额外空间的话,就把数字原创 2015-02-03 15:00:07 · 387 阅读 · 0 评论 -
LeetCode 14.Longest Common Prefix
题目:write a function to find the longest common prefix string amongst an array of strings.分析与解答:求一组字符串的最长公共前缀。很简单的题,先求出前两个字符串的最长prefix,再用后面的字符串和prefix求最长前缀。比较次数为较短的那个字符串长度。需要注意的是:1.如果vector为空则直原创 2015-02-04 11:58:26 · 410 阅读 · 0 评论 -
LeetCode 11.Container With Most Water
题目: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 endpoints of line i is at (i, ai) and (i,原创 2015-02-04 00:22:20 · 537 阅读 · 0 评论 -
LeetCode 7.Reverse Integer
题目:Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321分析与解答:看似简单的题目其实有两个陷阱,需要注意的是:1.如果输的数字以0结尾,比如12900,那反转之后应为921,少了一位;2.数值可能在经过反转之后而产生了溢出的问题。原创 2015-02-02 16:58:06 · 368 阅读 · 0 评论 -
LeetCode 6.ZigZag Conversion
题目:The 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 A H NA P原创 2015-02-02 15:30:31 · 364 阅读 · 0 评论 -
LeetCode 35.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原创 2015-02-17 14:20:33 · 371 阅读 · 0 评论 -
LeetCode 1.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 targ原创 2015-01-21 14:17:43 · 356 阅读 · 0 评论