leetcode
文章平均质量分 75
gqtcgq
这个作者很懒,什么都没留下…
展开
-
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 "()",which原创 2015-07-10 10:54:11 · 488 阅读 · 0 评论 -
Search in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 01 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 return its i原创 2015-07-19 22:48:59 · 416 阅读 · 0 评论 -
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 in t原创 2015-07-20 12:45:13 · 492 阅读 · 0 评论 -
Wildcard Matching
'?' Matches any single character.'*' Matches any sequence of characters(including the empty sequence). The matching should cover the entireinput string (not partial). The function prototype原创 2015-08-15 11:01:31 · 401 阅读 · 0 评论 -
Jump Game II
Given an array of non-negative integers, you are initially positioned at the firstindex of the array. Each element in the array represents your maximum jump length at that position. Yo原创 2015-08-16 16:12:01 · 457 阅读 · 0 评论 -
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 constantspac原创 2015-08-04 09:30:04 · 458 阅读 · 0 评论 -
Unique Paths I II
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 atany point in time. The robot is trying to rea原创 2015-08-23 21:28:51 · 495 阅读 · 0 评论 -
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 ri原创 2015-09-10 21:05:16 · 407 阅读 · 0 评论 -
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; t原创 2015-09-10 22:15:58 · 735 阅读 · 0 评论 -
sqrt函数实现
Implement int sqrt(int x). Compute and return the square root of x. 1:二分查找 思路:要实现一个sqrt函数,可以使用二分法,首先确定一个范围[begin, end],这个范围的中间数mid,看mid的平方是否等于x,如果相等,则返回mid,如果不等则缩小[begin,end]的范围,原创 2015-09-12 10:53:35 · 16427 阅读 · 2 评论 -
N-Queens
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.Eac原创 2015-08-22 15:25:02 · 498 阅读 · 0 评论 -
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,但是实际上比较简单,就是先排原创 2015-08-22 17:01:39 · 856 阅读 · 0 评论 -
Set Matrix Zeroes
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. Follow up:Did you use extra space?A straight forward solution using O(mn) space is probably a原创 2015-09-14 12:46:21 · 678 阅读 · 0 评论 -
Sort Colors
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 inte原创 2015-09-15 13:04:44 · 424 阅读 · 0 评论 -
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. Forexample, Given [0,1,0,2,1,0,1,3,2,1,2原创 2015-08-09 10:06:34 · 475 阅读 · 0 评论 -
Divide Two Integers
Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT. 思路:实现两个整数的除法,不能使用乘法,除法和移位操作。首先想到的是减法,但是减法速度太慢,比如10000000/1,总共需要10000000次减法,所以不适用。原创 2015-07-16 12:41:18 · 444 阅读 · 0 评论 -
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)). 思路:首先注意一点,这里所谓的”the me原创 2015-07-12 14:38:36 · 429 阅读 · 0 评论 -
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 i原创 2015-07-12 21:35:30 · 503 阅读 · 0 评论 -
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.原创 2015-07-12 10:14:23 · 504 阅读 · 0 评论 -
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 end points of line i is at (i, ai) and (i, 0). Find two原创 2015-07-13 10:50:12 · 464 阅读 · 0 评论 -
Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((()))","(()())", "(())()", "()(())", "()()()"原创 2015-07-14 11:32:24 · 482 阅读 · 0 评论 -
Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 思路:要快速找到k个元素中的最小值,使用堆这种数据结构。找到最小值后,还需要知道该最小值出自哪个链表,因此,堆中还需记录每个节点来自哪个链表。调整堆的时间复杂度为O(logk),所以总体时间复杂原创 2015-07-14 17:50:25 · 395 阅读 · 0 评论 -
Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain asit is.原创 2015-07-14 22:29:39 · 623 阅读 · 0 评论 -
Sudoku Solver
Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by thecharacter '.'.You may assume that there will be only one unique solution.原创 2015-07-28 22:03:16 · 479 阅读 · 0 评论 -
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.原创 2015-08-23 10:51:38 · 470 阅读 · 0 评论 -
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"原创 2015-08-23 13:16:42 · 477 阅读 · 0 评论 -
Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place wi原创 2015-07-15 16:48:19 · 717 阅读 · 0 评论 -
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-07-16 18:28:49 · 436 阅读 · 0 评论 -
Spiral Matrix II
Given an integer n, generate a square matrix filled with elements from 1 to n^2 in spiral order. For example,Given n = 3,You should return the followingmatrix:[ [ 1, 2, 3 ], [ 8, 9, 4原创 2015-08-22 15:43:58 · 452 阅读 · 0 评论 -
Search a 2D Matrix
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 row原创 2015-09-16 13:06:02 · 454 阅读 · 0 评论