【题目】Write a function to find the longest common prefix string amongst an array of strings.【解析】这道题比较简单，就是找出string数组中所有字符串的最大共同前缀。【代码】public class Solution { public String longestCommo

【题目】Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.You may assume the integer do not contain any leading zero, except the number 0 itself.

【题目】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

【题目】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

【题目】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

【题目】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 L

【题目】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?Note: Given n will be

【题目】Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.【解析】一个m*n的矩阵，如果有一个元素是0，就把它所在的行和列都设置为0.我们用第一行和第一列储存改行或列是否有0，最后再将第一行和第一列是0的行和列全部替换为0.【代码】

【题目】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

【题目】Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integ

【题目】Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the

【题目】Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3],

【题目】Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,3], a solution is:[ [

【题目】Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".【解析】字符串类型的二进制加法，从后往前加，再设置一个进位就ok了。【代码】public String addBinary(Stri

【题目】Implement int sqrt(int x).Compute and return the square root of x.【解析】求平方根，注意因为是int型，所以只用求到整数位即可。【代码】public int mySqrt(int x) { if(x==0) return 0;

题目很简单，就是知道前序遍历和中序遍历让我们推二叉树的结构。首先我们要知道前序遍历是先访问根节点，再访问左子树，再访问右子树。中序遍历先访问左子树，再访问根节点，最后访问右子树。例如一棵树如下： A B C D E F G前序遍历结果是A BDE CFG 中序遍历结果是DBE A FCG我用空格分开了根节点、左子树和右子树。然后

【题目】Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to

【题目】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,

【题目】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 all va

【题目】Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.【解析】要求实现strStr()函数。返回在子字符串needle在字符串haystack中第一次出现的位

LeetCode30-----------Substring with Concatenation of All Words看题目都有些费劲，要不是看了几组Custom Testcase才知道题意，顺便说一句Custom Testcase这个功能在调试的时候真的非常实用。题目意思：给定一个字串不妨称为母串S，和一组单词，他们保存在一个string的顺序容器Words中，并且满足一个条件

【题目】Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring i

【题目】Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partially f

【题目】The count-and-say sequence is the sequence of integers with the first five terms as following:1. 12. 113. 214. 12115. 1112211 is read off as "one 1" or 11.

【题目】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,

【题目】Given a collection of distinct 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],

【题目】You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?【解析】旋转矩阵discuss里一共有三个思想：1、上下对称后，对角线对称。

【题目】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,

【题目】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,

【题目】Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire in

【题目】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.D

【题目】Implement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).The matching shou

【题目】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].【解析】本题意思是要把给出的区间集合合并，输出合并后的区间集合。思路不难，主要是

这题164赞538踩。。好惨就是输入一个字符串数组，数组里每一项是一个单词。再输入一个maxWidth，这个长度是输出每一行的字符串长度。要求是每个单词和每个单词之间最少一个空格，如果一行最后剩余的位置不能再放一个单词，就把这一行后面的空格平均分到前面几个单词中间。 如果这一行只有一个单词或者这是最后一行，那么就不用管后面的空格了（但是还是要补充空格到maxWidth）。我的思路比较...