這個人似乎來自地球
發(fā)簡信
IP屬地：不列顛哥倫比亞
-
80. Remove Duplicates from Sorted Array II
Problem Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?...
-
76. Minimum Window Substring
題目 Given a string S and a string T, find the minimum window in S which will contain all...
-
75. Sort Colors
題目 Given an array with n objects colored red, white or blue, sort them so that objects ...
-
74. Search a 2D Matrix
題目 Write an efficient algorithm that searches for a value in an m x n matrix. This matr...
-
73. Set Matrix Zeroes
題目 Given a mxn matrix, if an element is 0, set its entire row and column to 0. Do it in...
-
72. Edit Distance
題目 Given two words word1 and word2, find the minimum number of steps required to conver...
-
120. Triangle
題目 Given a triangle, find the minimum path sum from top to bottom. Each step you may mo...
-
71. Simplify Path
題目 Given an absolute path for a file (Unix-style), simplify it.For example,path = "/hom...
-
70. Climbing Stairs
題目 You are climbing a stair case. It takes n steps to reach to the top. Each time you c...
-
69. Sqrt(x)
題目 Implement int sqrt(int x). Compute and return the square root of x. 分析 主要思想很簡單，就用二分法...
-
68. Text Justification
題目 Given an array of words and a length L, format the text such that each line has exac...
-
67. Add Binary
題目 Given two binary strings, return their sum (also a binary string). For example,a = "...
-
66. Plus One
題目 Given a non-negative integer represented as a non-empty array of digits, plus one to...
-
65. Valid Number
題目 Validate if a given string is numeric. Some examples:"0" => true" 0.1 " => true"abc"...
-
64. Minimum Path Sum
題目 Given a m x n grid filled with non-negative numbers, find a path from top left to bo...
-
63. Unique Paths II
題目 Follow up for "Unique Paths": Now consider if some obstacles are added to the grids....
-
62. Unique Paths
題目 A robot is located at the top-left corner of a m x n grid (marked 'Start' in the dia...
-
61. Rotate List
題目 Given a list, rotate the list to the right by k places, where k is non-negative. For...
