摘要: 46. Permutations Given a collection of distinct integers, return all possible permutations. Example: 阅读全文
posted @ 2019-02-24 22:31 mingL 阅读(141) 评论(0) 推荐(0) 编辑
摘要: 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 repr 阅读全文
posted @ 2019-02-23 23:49 mingL 阅读(94) 评论(0) 推荐(0) 编辑
摘要: 44. Wildcard Matching Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*'. The matching shou 阅读全文
posted @ 2019-02-23 23:42 mingL 阅读(126) 评论(0) 推荐(0) 编辑
摘要: 43. Multiply Strings Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a 阅读全文
posted @ 2019-02-23 23:40 mingL 阅读(151) 评论(0) 推荐(0) 编辑
摘要: 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 abl 阅读全文
posted @ 2019-02-23 23:22 mingL 阅读(138) 评论(0) 推荐(0) 编辑
摘要: 41. First Missing Positive Given an unsorted integer array, find the smallest missing positive integer. Example 1: Example 2: Example 3: 阅读全文
posted @ 2019-02-23 23:19 mingL 阅读(99) 评论(0) 推荐(0) 编辑
摘要: 40. Combination Sum II Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates w 阅读全文
posted @ 2019-02-21 22:02 mingL 阅读(244) 评论(0) 推荐(0) 编辑
摘要: 39. Combination Sum Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in c 阅读全文
posted @ 2019-02-21 21:49 mingL 阅读(215) 评论(0) 推荐(0) 编辑
摘要: 38. Count and Say The count-and-say sequence is the sequence of integers with the first five terms as following: 1 is read off as "one 1" or 11.11 is 阅读全文
posted @ 2019-02-21 21:14 mingL 阅读(156) 评论(0) 推荐(0) 编辑
摘要: 37. Sudoku Solver Write a program to solve a Sudoku puzzle by filling the empty cells. A sudoku solution must satisfy all of the following rules: Empt 阅读全文
posted @ 2019-02-21 21:05 mingL 阅读(152) 评论(0) 推荐(0) 编辑
摘要: 36. Valid Sudoku Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: A partially fi 阅读全文
posted @ 2019-02-21 20:58 mingL 阅读(125) 评论(0) 推荐(0) 编辑
摘要: 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 b 阅读全文
posted @ 2019-02-20 21:28 mingL 阅读(167) 评论(0) 推荐(0) 编辑
摘要: 34. Find First and Last Position of Element in Sorted Array Given an array of integers nums sorted in ascending order, find the starting and ending po 阅读全文
posted @ 2019-02-20 21:25 mingL 阅读(130) 评论(0) 推荐(0) 编辑
摘要: 33. Search in Rotated Sorted Array Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6, 阅读全文
posted @ 2019-02-20 21:22 mingL 阅读(94) 评论(0) 推荐(0) 编辑
摘要: 32. Longest Valid Parentheses Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parenthese 阅读全文
posted @ 2019-02-20 21:18 mingL 阅读(133) 评论(0) 推荐(0) 编辑
摘要: 31. Next Permutation Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arra 阅读全文
posted @ 2019-02-19 21:05 mingL 阅读(198) 评论(0) 推荐(0) 编辑
摘要: 30. Substring with Concatenation of All Words You are given a string, s, and a list of words, words, that are all of the same length. Find all startin 阅读全文
posted @ 2019-02-17 22:40 mingL 阅读(92) 评论(0) 推荐(0) 编辑
摘要: 29. Divide Two Integers Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator. Return t 阅读全文
posted @ 2019-02-17 21:54 mingL 阅读(221) 评论(0) 推荐(0) 编辑
摘要: 28. Implement strStr() Implement strStr(). Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Ex 阅读全文
posted @ 2019-02-17 21:49 mingL 阅读(121) 评论(0) 推荐(0) 编辑
摘要: 27. Remove Element Given an array nums and a value val, remove all instances of that value in-place and return the new length. Do not allocate extra s 阅读全文
posted @ 2019-02-17 21:43 mingL 阅读(207) 评论(0) 推荐(0) 编辑