# (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 have the following 3 operations permitted on a word:...

# (Java)LeetCode-71. Simplify Path

Given an absolute path for a file (Unix-style), simplify it. For example, path = "/home/", => "/home" path = "/a/./b/../../c/", => "/c" Corner Cases: Did you consider the case where path ...

# (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 you climb to the top? 这道题是一个比较经典比较简单的问题。 ...

# (Java)LeetCode-69. Sqrt(x)

Implement int sqrt(int x). Compute and return the square root of x. 这道题么，当然最简单的方法就是一行代码  return（int）Math.sqrt(x); 不过出于强迫症，还是用二分法又写了一遍代码。需要注意的地方是循环应该是while(left public int mySq...

# (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 should pack your words in a greedy approach; that i...

Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Return "100". 这道题也是木有什么难度，总体来说和上一题很像。 从后向前遍历一遍即可。注意有进位的情况。 public String addBinary(S...

# (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 is at the head of the list. 这道题题意刚开始没看明白。。...

# (Java)LeetCode-65. Valid Number

Validate if a given string is numeric. Some examples: "0" => true " 0.1 " => true "abc" => false "1 a" => false "2e10" => true Note: It is intended for the problem statement to be ambiguo...

# (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. Note: You can only move either down or right at...

# 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 in the ...

# (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 any point in time. The robot is trying to reach the ...

# (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, return 4->5->1->2->3->NULL. 这道题也不是很难。循环右移一个链表。要注意的是循环的位数可能会...

# (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 sequence (ie, for n = 3): "123""132""213""231""3...

# (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 following matrix: [ [ 1, 2, 3 ], [ 8, 9, 4 ], [...

# (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 last word does not exist, return 0. Note: A word is...

# (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 initially sorted according to their start times. E...

# (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]. 这道题是Hard难度，看上去确实比较麻烦。最后居然AC了比较开心，虽然只打败了30%...

# (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 maximum jump length at that position. Determine i...

# (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: [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ] ...

# (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,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] ha...

96条 共5页1 2 3 4 5 ... 下一页 尾页
个人资料
• 访问：20012次
• 积分：1108
• 等级：
• 排名：千里之外
• 原创：96篇
• 转载：0篇
• 译文：0篇
• 评论：2条
文章分类
阅读排行
评论排行
最新评论