- 博客(27)
- 收藏
- 关注
原创 [LeetCode]Minimum Window Substring
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T = "ABC"Minimum window is "BAN
2015-11-26 20:13:30 360
原创 [LeetCode]Search a 2D Matrix II
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 integer of each
2015-11-26 16:22:19 384
原创 [LeetCode]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:
2015-11-26 15:36:48 334
原创 [LeetCode]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
2015-11-26 00:36:48 304
原创 [LeetCode]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.双指针,找到要rotate的指针位置即可。/** *
2015-11-24 16:49:16 302
原创 [LeetCode]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 ], [ 7, 6, 5 ]
2015-11-23 14:45:43 287
原创 [LeetCode]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
2015-11-23 14:28:57 282
原创 [LeetCode]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 ]]
2015-11-22 23:13:22 316
原创 [LeetCode]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], and [2,1,1].
2015-11-22 17:02:48 347
原创 [Python]利用python爬虫去LeetCode上下载Ac解
import urllib, urllib2, cookielib, reimport ssl import sysreload(sys)sys.setdefaultencoding( "utf-8" ) #编码方式ssl._create_default_https_context = ssl._create_unverified_contextNAME = ''PWD = ''
2015-11-22 13:34:32 822
原创 [LeetCode]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
2015-11-22 13:27:41 337
原创 [LeetCode]Longest Substring Without Repeating Characters
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.大整数乘法,通过模拟手算过程来完成。把结果存在整型数组里,先做乘加
2015-11-22 13:25:43 279
原创 [LeetCode]Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo
2015-11-18 19:25:07 336
原创 [LeetCode]First Missing Positive
Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses constant
2015-11-17 11:00:40 287
原创 [LeetCode]Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combina
2015-11-17 00:17:14 276
原创 [LeetCode]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
2015-11-16 23:01:23 254
原创 [LeetCode]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
2015-11-16 21:52:36 291
原创 [LeetCode]Next Permutation
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possible
2015-11-16 21:43:21 204
原创 [LeetCode]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 "()",
2015-11-15 10:45:59 279
原创 [LeetCode]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 starting indices of substring(s) in s that is a concatenation of each word in words exactly once and
2015-11-12 15:51:18 308
原创 [LeetCode]Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.采用Merge Sort的思路来写,分开然后合并。特别注意递归的时候链表数组要用引用操作,不然会超时。/** * Definition for singly-linked list.
2015-11-11 16:44:40 300
原创 [LeetCode]Range Sum Query - Immutable
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example:Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2) -> 1sumRange(2, 5) -> -1sumRan
2015-11-11 14:52:33 407
原创 [LeetCode]4Sum
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note:Element
2015-11-10 15:27:32 314
原创 [LeetCode]3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact
2015-11-10 13:30:27 345
原创 [LeetCode]3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c
2015-11-10 11:39:29 346
原创 [LeetCode]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.Manacher 线性算法
2015-11-10 11:36:45 339
原创 [LeetCode]Longest Increasing Subsequence
Given an unsorted array of integers, find the length of longest increasing subsequence.For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest increasing subsequence is [2, 3, 7, 101], ther
2015-11-04 12:42:40 352
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人