LeetCode
nameix
这个作者很懒,什么都没留下…
展开
-
LeetCode----Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution.Example:Given nums =原创 2016-09-14 15:29:51 · 186 阅读 · 0 评论 -
LeetCode-----34. Search for a Range(查找范围)
Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not found原创 2016-09-28 21:16:29 · 290 阅读 · 0 评论 -
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原创 2016-11-04 22:37:13 · 355 阅读 · 0 评论 -
LeetCode------33. Search in Rotated Sorted Array(旋转数组中查找)
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array retur原创 2016-09-28 19:40:36 · 230 阅读 · 0 评论 -
LeetCode----32. Longest Valid Parentheses(最长有效括号)
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 is "()",原创 2016-09-28 17:10:40 · 220 阅读 · 0 评论 -
LeetCode-------43. Multiply Strings(字符串的乘法运算)
Given two numbers represented as strings, return multiplication of the numbers as a string.Note:The numbers can be arbitrarily large and are non-negative.Converting the input string to integ原创 2016-10-14 11:46:06 · 397 阅读 · 0 评论 -
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原创 2016-11-04 21:01:23 · 323 阅读 · 0 评论 -
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].Subscribe to see which companies asked this qu原创 2016-11-04 14:30:50 · 668 阅读 · 0 评论 -
LeetCode-----48. Rotate Image(二维矩阵旋转90度)
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?原创 2016-10-24 19:39:05 · 1639 阅读 · 0 评论 -
LeetCode----30. Substring with Concatenation of All Words(串联所有的words)
You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once and原创 2016-09-28 09:08:01 · 314 阅读 · 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 i原创 2016-11-04 11:00:00 · 776 阅读 · 0 评论 -
LeetCode------42. Trapping Rain Water(捕获雨水量)
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Given [0,1,0,2,1,0,1,3,2,1,2,1]原创 2016-10-13 13:25:38 · 1306 阅读 · 0 评论 -
LeetCode-----46.Permutations&&47.Permutations II (全排列----回溯法)
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,1], [2,1原创 2016-10-22 15:20:21 · 421 阅读 · 0 评论 -
LeetCode---35. Search Insert Position(查找插入位置)
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.原创 2016-09-28 21:50:16 · 627 阅读 · 0 评论 -
LeetCode----49. Group Anagrams(颠倒字母的组合)
Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","tea"], ["nat","tan"], ["bat"]]Note: Al原创 2016-10-25 14:55:04 · 312 阅读 · 0 评论 -
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"注意:/. //. // /.. 等情况(可以考虑 栈 操作)Input:"/abc/..原创 2017-01-12 19:19:04 · 411 阅读 · 0 评论 -
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.Subscribe to see which compan原创 2016-11-14 11:30:39 · 239 阅读 · 0 评论 -
LeetCode--------39. Combination Sum(组合和)
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C unlimited numb原创 2016-10-06 22:26:11 · 238 阅读 · 0 评论 -
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原创 2016-10-28 16:02:07 · 369 阅读 · 0 评论 -
LeetCode-------60. Permutation Sequence(n的全排列中第K列)
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原创 2016-11-08 11:31:19 · 863 阅读 · 0 评论 -
LeetCode------54. Spiral Matrix(螺旋二维矩阵)-----59. Spiral Matrix II(n的螺旋矩阵)
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 ]]原创 2016-11-04 10:24:19 · 334 阅读 · 0 评论 -
LeetCode----38. Count and Say(计算及读取)
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as原创 2016-09-30 11:01:39 · 340 阅读 · 0 评论 -
LeetCode-----37. Sudoku Solver(解数读)
Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one unique solution.A sudoku原创 2016-09-29 15:26:07 · 286 阅读 · 0 评论 -
LeetCode----36. Valid Sudoku(有效数读)
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 fille原创 2016-09-29 10:22:24 · 346 阅读 · 0 评论 -
LeetCode---50. Pow(x, n)(指数运算x的n次方)
Implement pow(x, n).Subscribe to see which companies asked this question//思路:主要考察越界,n为负数等问题方法一:APIpublic class Solution { public double myPow(double x, int n) { // double Mat原创 2016-10-25 15:20:33 · 446 阅读 · 0 评论 -
LeetCode--------45. Jump Game II(跳跃游戏--最短路径)
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.Your goal i原创 2016-10-22 15:02:40 · 1188 阅读 · 0 评论 -
LeetCode----29. Divide Two Integers (两数相除)
Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.Subscribe to see which companies asked this question//不能使用乘法,或者除法//考虑除数和被除原创 2016-09-26 15:47:17 · 296 阅读 · 0 评论 -
LeetCode----28. Implement strStr()
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.public class Solution { public int strStr(String haystack, Strin原创 2016-09-26 14:03:51 · 219 阅读 · 0 评论 -
LeetCode---5. Longest Palindromic Substring(最长回文子串)
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.Subscribe to see w原创 2016-09-14 21:27:37 · 207 阅读 · 0 评论 -
LeetCode----14. Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.Subscribe to see which companies asked this question判断所有字符串的公共前序;Runtime Error Message:Line 9: j原创 2016-09-18 21:08:51 · 219 阅读 · 0 评论 -
LeetCode-----13. Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.Subscribe to see which companies asked this question原创 2016-09-18 15:09:15 · 198 阅读 · 0 评论 -
LeetCode----12. Integer to Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.Subscribe to see which companies asked this question罗马数字:I: 1; V:5;原创 2016-09-18 14:11:17 · 201 阅读 · 0 评论 -
LeetCode------11. Container With Most Water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Fin原创 2016-09-18 13:52:53 · 193 阅读 · 0 评论 -
LeetCode----10**. Regular Expression Matching
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 input st原创 2016-09-18 10:13:54 · 311 阅读 · 0 评论 -
LeetCode-----9. Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.public class Solution { public boolean isPalindrome(int x) { String s=x+""; int start=0,end=s.length()-原创 2016-09-18 09:29:11 · 170 阅读 · 0 评论 -
LeetCode----8. String to Integer (atoi)
Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input case原创 2016-09-17 21:09:14 · 184 阅读 · 0 评论 -
LeetCode---7. Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Subscribe to see which companies asked this question//翻转过来可能会溢出原创 2016-09-17 20:38:58 · 181 阅读 · 0 评论 -
LeetCode----6. ZigZag Conversion
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 S I原创 2016-09-17 20:32:17 · 179 阅读 · 0 评论 -
LeetCode-----4. Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays.The overall run time complexity should be O(log (m+n)).Example 1:nums1 = [1,原创 2016-09-14 15:56:58 · 171 阅读 · 0 评论 -
LeetCOde------3.Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "b",原创 2016-09-14 15:44:37 · 183 阅读 · 0 评论