LeetCode
文章平均质量分 71
huazi0204
这个作者很懒,什么都没留下…
展开
-
LeetCode 45: 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原创 2013-08-12 08:34:31 · 647 阅读 · 0 评论 -
LeetCode32: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 ret原创 2013-02-25 05:01:58 · 515 阅读 · 0 评论 -
LeetCode31: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 "()",原创 2013-02-25 02:58:49 · 303 阅读 · 0 评论 -
LeetCode25: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原创 2013-02-23 06:18:29 · 356 阅读 · 0 评论 -
LeetCode26:Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length.p原创 2013-02-23 06:41:25 · 260 阅读 · 0 评论 -
LeetCode22: Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. * Definition for singly-linked list. * public class ListNode { * int val; * ListNo原创 2013-02-22 15:29:48 · 341 阅读 · 0 评论 -
LeetCode23:Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space.原创 2013-02-23 03:23:04 · 334 阅读 · 0 评论 -
LeetCode21: 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:"((()))", "(()())", "(())()", "()(())", "()原创 2013-02-22 14:56:13 · 301 阅读 · 0 评论 -
LeetCode19:Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, t原创 2013-02-22 11:20:26 · 331 阅读 · 0 评论 -
LeetCode15: 3 Sum
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原创 2013-02-20 12:42:17 · 324 阅读 · 0 评论 -
LeetCode34: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.原创 2013-02-25 12:39:32 · 303 阅读 · 0 评论 -
LeetCode35: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 fil原创 2013-02-25 13:11:05 · 620 阅读 · 0 评论 -
LeetCode 43: 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 consta原创 2013-04-19 05:29:57 · 681 阅读 · 0 评论 -
LeetCode 44: 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,原创 2013-04-20 02:46:23 · 553 阅读 · 0 评论 -
LeetCode 42: 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 c原创 2013-04-10 13:13:32 · 854 阅读 · 0 评论 -
LeetCode 40: 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原创 2013-04-10 11:58:31 · 936 阅读 · 0 评论 -
LeetCode 41: 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原创 2013-04-10 12:58:08 · 722 阅读 · 0 评论 -
LeetCode 38: 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 pu原创 2013-04-09 13:44:05 · 600 阅读 · 0 评论 -
LeetCode24: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 as it is原创 2013-02-23 06:07:31 · 407 阅读 · 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原创 2013-04-08 13:50:05 · 1584 阅读 · 0 评论 -
Leetcode 36: Combinations
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], [1,4原创 2013-04-07 00:46:01 · 794 阅读 · 0 评论 -
LeetCode20: Valid Parentheses
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原创 2013-02-22 14:09:40 · 352 阅读 · 0 评论 -
LeetCode18:Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit st原创 2013-02-22 11:03:49 · 326 阅读 · 0 评论 -
LeetCode17: 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:原创 2013-02-22 06:08:16 · 444 阅读 · 0 评论 -
LeetCode29: Substring with Concatenation of All Words
You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without原创 2013-02-24 12:28:21 · 589 阅读 · 0 评论 -
LeetCode28:Divide Two Integers
Divide two integers without using multiplication, division and mod operator.public class Solution { public int divide(int dividend, int divisor) { // Start typing your Java solution be原创 2013-02-24 02:29:10 · 334 阅读 · 0 评论 -
Leetcode11: 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). F原创 2013-02-20 05:31:40 · 360 阅读 · 0 评论 -
LeetCode 16: 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 exa原创 2013-02-20 14:04:55 · 569 阅读 · 0 评论 -
LeetCode12: Integer to Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.public class Solution { public String intToRoman(int num) { // Start typin原创 2013-02-20 06:13:58 · 274 阅读 · 0 评论 -
Leetcode13: Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.public class Solution { public int romanToInt(String s) { // Start typing your原创 2013-02-20 09:20:27 · 291 阅读 · 0 评论 -
LeetCode9:Palindromic Number
Determine whether an integer is a palindrome. Do this without extra space.public class Solution { public boolean isPalindrome(int x) { // Start typing your Java solution below原创 2013-02-18 13:21:43 · 288 阅读 · 0 评论 -
LeetCode30: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原创 2013-02-25 02:22:02 · 328 阅读 · 0 评论 -
LeetCode5: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.##Brute Force#原创 2013-02-13 11:27:52 · 356 阅读 · 0 评论 -
Leetcode14: Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.public class Solution { public String longestCommonPrefix(String[] strs) { // Start typing your原创 2013-02-20 09:54:57 · 285 阅读 · 0 评论 -
LeetCode33: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原创 2013-02-25 10:41:21 · 291 阅读 · 0 评论 -
LeetCode2: Median of Two sorted array.
There are two sorted arrays A and B 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)).public class Solution {原创 2013-02-13 06:31:47 · 623 阅读 · 0 评论 -
LeetCode7: Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321Have you thought about this?Here are some good questions to ask before coding. Bonus points for y原创 2013-02-16 15:36:57 · 296 阅读 · 0 评论 -
Leetcode8: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原创 2013-02-17 03:34:55 · 314 阅读 · 0 评论 -
LeetCode3: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原创 2013-02-13 08:06:46 · 332 阅读 · 0 评论 -
LeetCode6: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原创 2013-02-16 08:41:54 · 344 阅读 · 0 评论