LeetCode
hope1262946533
这个作者很懒,什么都没留下…
展开
-
【LeetCode】53. Maximum Subarray
题目:Given an integer arraynums, find the contiguous subarray(containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,1,-5,4],Output: 6Expl...原创 2019-05-03 13:42:35 · 82 阅读 · 0 评论 -
【LeetCode】60. Permutation Sequence
题目:The set[1,2,3,...,n]contains a total ofn! unique permutations.By listing and labeling all of the permutations in order, we get the following sequence forn= 3:"123" "132" "213" "231" ...原创 2019-05-06 08:49:57 · 81 阅读 · 0 评论 -
【LeetCode】63. Unique Paths II
题目:A robot is located at the top-left corner of amxngrid (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 reach t...原创 2019-05-08 22:17:19 · 129 阅读 · 0 评论 -
【LeetCode】61. Rotate List
题目:Given a linkedlist, rotate the list to the right bykplaces, wherekis non-negative.Example 1:Input: 1->2->3->4->5->NULL, k = 2Output: 4->5->1->2->3->NULLE...原创 2019-05-06 20:46:48 · 132 阅读 · 0 评论 -
【LeetCode】75. Sort Colors
题目:Given an array withnobjects colored red, white or blue, sort themin-placeso that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use t...原创 2019-05-19 09:46:41 · 111 阅读 · 0 评论 -
【LeetCode】62. Unique Paths
题目:A robot is located at the top-left corner of amxngrid (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 reach t...原创 2019-05-06 23:14:57 · 90 阅读 · 0 评论 -
【LeetCode】64. 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:You can only move either down or right...原创 2019-05-09 08:44:00 · 88 阅读 · 0 评论 -
【LeetCode】65. Valid Number
题目:Validate if a given string can be interpreted asa decimal number.Some examples:"0"=>true" 0.1 "=>true"abc"=>false"1 a"=>false"2e10"=>true" -90e3 "=>true" 1e"=&...原创 2019-05-10 21:40:10 · 104 阅读 · 0 评论 -
【LeetCode】72. Edit Distance
题目:Given two wordsword1andword2, find the minimum number of operations required to convertword1toword2.You have the following 3 operations permitted on a word:Insert a character Delete a ...原创 2019-05-15 08:57:35 · 87 阅读 · 0 评论 -
【LeetCode】66. Plus One
题目:Given anon-emptyarray of digitsrepresenting a non-negative integer, plus one to the integer.The digits are stored such that the most significant digit is at the head of the list, and each el...原创 2019-05-10 22:03:43 · 93 阅读 · 0 评论 -
【LeetCode】59. Spiral Matrix II
题目:Given a positive integern, generate a square matrix filled with elements from 1 ton2in spiral order.Example:Input: 3Output:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6, 5 ]]描述:给出一个n表示要...原创 2019-05-06 08:30:21 · 93 阅读 · 0 评论 -
【LeetCode】58. Length of Last Word
题目:Given a stringsconsists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word does not exist, return 0.Note:A word is ...原创 2019-05-05 21:09:12 · 97 阅读 · 0 评论 -
【LeetCode】50. Pow(x, n)
题目:Implementpow(x,n), which calculatesxraised to the powern(xn).Example 1:Input: 2.00000, 10Output: 1024.00000Example 2:Input: 2.10000, 3Output: 9.26100Example 3:Input: 2.00...原创 2019-04-29 22:44:32 · 78 阅读 · 0 评论 -
【LeetCode】43. Multiply Strings
题目:Given two non-negative integersnum1andnum2represented as strings, return the product ofnum1andnum2, also represented as a string.Example 1:Input: num1 = "2", num2 = "3"Output: "6"E...原创 2019-04-23 22:06:43 · 93 阅读 · 0 评论 -
【LeetCode】46. Permutations
题目:Given a collection ofdistinctintegers, return all possible permutations.Example:Input: [1,2,3]Output:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]]描述:给出一个数组,...原创 2019-04-28 20:57:23 · 108 阅读 · 0 评论 -
【LeetCode】47. Permutations II
题目:Given a collection of numbers that might contain duplicates, return all possible unique permutations.Example:Input: [1,1,2]Output:[ [1,1,2], [1,2,1], [2,1,1]]描述:给出一个有重复元素的数组,...原创 2019-04-28 21:09:34 · 88 阅读 · 0 评论 -
【LeetCode】54. Spiral Matrix
题目:Given a matrix ofmxnelements (mrows,ncolumns), return all elements of the matrix in spiral order.Example 1:Input:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]Output: [1,2,3,6,9,8,7,4...原创 2019-05-04 09:42:13 · 110 阅读 · 0 评论 -
【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.Determine ...原创 2019-05-04 12:15:42 · 94 阅读 · 0 评论 -
【LeetCode】48. Rotate Image
题目:You are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Note:You have to rotate the imagein-place, which means you have to modify the input 2D mat...原创 2019-04-28 23:15:54 · 80 阅读 · 0 评论 -
【LeetCode】49. Group Anagrams
题目:Given an array of strings, group anagrams together.Example:Input: ["eat", "tea", "tan", "ate", "nat", "bat"],Output:[ ["ate","eat","tea"], ["nat","tan"], ["bat"]]Note:All inputs...原创 2019-04-29 22:29:23 · 94 阅读 · 0 评论 -
【LeetCode】56. Merge Intervals
题目:Given a collection of intervals, merge all overlapping intervals.Example 1:Input: [[1,3],[2,6],[8,10],[15,18]]Output: [[1,6],[8,10],[15,18]]Explanation: Since intervals [1,3] and [2,6] ove...原创 2019-05-04 20:37:34 · 117 阅读 · 0 评论 -
【LeetCode】57. Insert Interval
题目:Given a set ofnon-overlappingintervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times....原创 2019-05-04 23:08:58 · 99 阅读 · 0 评论 -
【LeetCode】67. Add Binary
题目:Given two binary strings, return their sum (also a binary string).The input strings are bothnon-emptyand contains only characters1or0.Example 1:Input: a = "11", b = "1"Output: "100"...原创 2019-05-10 22:22:52 · 97 阅读 · 0 评论 -
【LeetCode】68. Text Justification
题目:Given an array of words and a widthmaxWidth, format the text such that each line has exactlymaxWidthcharacters and is fully (left and right) justified.You should pack your words in a greedy a...原创 2019-05-11 11:06:54 · 113 阅读 · 0 评论 -
【LeetCode】83. Remove Duplicates from Sorted List
题目:Given a sorted linked list, delete all duplicates such that each element appear onlyonce.Example 1:Input: 1->1->2Output: 1->2Example 2:Input: 1->1->2->3->3Outpu...原创 2019-05-31 22:56:58 · 106 阅读 · 0 评论 -
【LeetCode】84. Largest Rectangle in Histogram
题目:Givennnon-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width ...原创 2019-06-04 22:33:24 · 120 阅读 · 0 评论 -
【LeetCode】86. Partition List
题目:Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the original relative order of the nodes in each...原创 2019-06-12 22:49:54 · 106 阅读 · 0 评论 -
【LeetCode】87. Scramble String
题目:Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation ofs1="great": great / \ ...原创 2019-06-24 21:58:58 · 164 阅读 · 0 评论 -
【LeetCode】85. Maximal Rectangle【未完待续】
题目:Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.Example:Input:[ ["1","0","1","0","0"], ["1","0","1","1","1"], ["1"...原创 2019-06-11 22:29:06 · 109 阅读 · 0 评论 -
【LeetCode】88. Merge Sorted Array
题目:Given two sorted integer arraysnums1andnums2, mergenums2intonums1as one sorted array.Note:The number of elements initialized innums1andnums2aremandnrespectively. You may assume...原创 2019-07-01 21:44:16 · 192 阅读 · 0 评论 -
【LeetCode】89. Gray Code【未完待续】
题目:The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integernrepresenting the total number of bits in the code, print the sequence ...原创 2019-07-12 23:03:05 · 139 阅读 · 0 评论 -
【LeetCode】90. Subsets II
题目:Given a collection of integers that might contain duplicates,nums, return all possible subsets (the power set).Note:The solution set must not contain duplicate subsets.Example:Input: [1,...原创 2019-07-15 21:35:54 · 218 阅读 · 0 评论 -
【LeetCode】91. Decode Ways
题目:A message containing letters fromA-Zis being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given anon-emptystring containing only digits, determ...原创 2019-07-24 22:31:03 · 222 阅读 · 0 评论 -
【LeetCode】82. Remove Duplicates from Sorted List II
题目:Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.Example 1:Input: 1->2->3->3->4->4->5Output: ...原创 2019-05-31 22:50:43 · 93 阅读 · 0 评论 -
【LeetCode】81. Search in Rotated Sorted Array II
题目:Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e.,[0,0,1,2,2,5,6]might become[2,5,6,0,0,1,2]).You are given a target value to search. If f...原创 2019-05-29 22:56:23 · 101 阅读 · 0 评论 -
【LeetCode】80. Remove Duplicates from Sorted Array II
题目:Given a sorted arraynums, remove the duplicatesin-placesuch that duplicates appeared at mosttwiceand return the new length.Do not allocate extra space for another array, you must do this b...原创 2019-05-28 21:17:32 · 104 阅读 · 0 评论 -
【LeetCode】69. Sqrt(x)
题目:Implementint sqrt(int x).Compute and return the square root ofx, wherexis guaranteed to be a non-negative integer.Since the return typeis an integer, the decimal digits are truncated and...原创 2019-05-11 14:56:00 · 86 阅读 · 0 评论 -
【LeetCode】70. Climbing Stairs
题目:You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Note:Givennwill be a pos...原创 2019-05-11 15:39:58 · 96 阅读 · 0 评论 -
【LeetCode】71. Simplify Path
题目:Given anabsolute pathfor a file (Unix-style), simplify it. Or in other words, convert it to thecanonical path.In a UNIX-style file system, a period.refers to the current directory. Further...原创 2019-05-12 22:21:28 · 101 阅读 · 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).Example:Input: S = "ADOBECODEBANC", T = "ABC"Output: "BANC"Not...原创 2019-05-24 20:43:58 · 105 阅读 · 0 评论