排序:
默认
按更新时间
按访问量

(Java)LeetCode-72. Edit Distance

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You h...

2016-11-09 17:03:29

阅读数:251

评论数:0

(Java)LeetCode-71. Simplify Path

Given an absolute path for a file (Unix-style), simplify it. For example, path = "/home/", => "/home" path = "/a/./b...

2016-11-09 10:29:53

阅读数:131

评论数:0

(Java)LeetCode-70. Climbing Stairs

You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can yo...

2016-11-06 16:01:21

阅读数:247

评论数:0

(Java)LeetCode-69. Sqrt(x)

Implement int sqrt(int x). Compute and return the square root of x. 这道题么,当然最简单的方法就是一行代码  return(int)Math.sqrt(x); 不过出于强迫症,还是用二分法又写了一遍代...

2016-11-03 16:02:19

阅读数:245

评论数:0

(Java)LeetCode-68. Text Justification

Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified. You ...

2016-11-02 22:37:03

阅读数:132

评论数:0

(Java)LeetCode-67. Add Binary

Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Return "100". ...

2016-11-02 17:01:53

阅读数:222

评论数:0

(Java)LeetCode-66. 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 ...

2016-11-02 15:03:05

阅读数:310

评论数:0

(Java)LeetCode-65. Valid Number

Validate if a given string is numeric. Some examples: "0" => true " 0.1 " => true "abc" => false "1 a&qu...

2016-10-07 20:41:05

阅读数:136

评论数:0

(Java)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....

2016-10-07 16:25:49

阅读数:272

评论数: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 obstacl...

2016-10-07 15:30:13

阅读数:152

评论数:0

(Java)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 a...

2016-10-06 21:54:21

阅读数:286

评论数:0

(Java)LeetCode-61. Rotate List

Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given 1->2->3->4->5->NULL and k = 2,...

2016-10-06 17:52:28

阅读数:346

评论数:0

(Java)LeetCode-60. Permutation Sequence

The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, We get the following ...

2016-10-05 23:52:58

阅读数:370

评论数:0

(Java)LeetCode-59. Spiral Matrix II

Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order. For example, Given n = 3, You should return the foll...

2016-10-05 22:21:08

阅读数:113

评论数:0

(Java)LeetCode-58. Length of Last Word

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If the las...

2016-10-05 20:56:26

阅读数:87

评论数:0

(Java)LeetCode-57. 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 in...

2016-10-05 15:49:00

阅读数:137

评论数:0

(Java)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]. ...

2016-10-04 22:27:08

阅读数:150

评论数:0

(Java)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 m...

2016-10-04 14:03:21

阅读数:125

评论数:0

(Java)LeetCode-54. Spiral Matrix

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example, Given the following matrix:...

2016-10-03 17:53:49

阅读数:133

评论数:0

(Java)LeetCode-53. 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,-...

2016-10-03 16:52:38

阅读数:158

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭