LeetCode
文章平均质量分 61
关于目前LeetCode解体报告和代码
hackerzchao
总是有人要赢的,为什么不能是我呢?
展开
-
LeetCode: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原创 2015-03-31 10:46:50 · 814 阅读 · 0 评论 -
LeetCode:Longest Consecutive Sequence
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is [1, 2,原创 2015-03-30 20:30:19 · 815 阅读 · 0 评论 -
LeetCode: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]原创 2015-02-11 12:15:03 · 860 阅读 · 0 评论 -
LeetCode:Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B.原创 2015-02-02 21:58:28 · 849 阅读 · 0 评论 -
LeetCode:Pascal's Triangle II
Given an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1]. Note:Could you optimize your algorithm to use only O(k) extra space? // https://o原创 2015-02-02 21:40:16 · 659 阅读 · 0 评论 -
LeetCode:Pascal's Triangle
Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5,Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]// https://oj.leetcod原创 2015-02-02 21:29:27 · 647 阅读 · 0 评论 -
LeetCode:Remove Duplicates from Sorted Array II
Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array A = [1,1,1,2,2,3], Your function should return length = 5, and A is now [1,1,2,2,3原创 2015-02-01 00:24:34 · 565 阅读 · 0 评论 -
LeetCode:Find Minimum in Rotated Sorted Array II
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).Find the minimum element.The array may contain duplicates.// http原创 2015-02-01 00:05:11 · 678 阅读 · 0 评论 -
LeetCode:Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.// https://oj.leetco原创 2015-01-29 23:00:31 · 903 阅读 · 0 评论 -
LeetCode: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.click to show follow up.Follow up:Did you use extra space?A straight forward solution using O(mn)原创 2015-01-29 20:17:03 · 698 阅读 · 0 评论 -
LeetCode:Search in Rotated Sorted Array II
Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to determine if a given target is in the arr原创 2015-01-29 19:29:11 · 575 阅读 · 0 评论 -
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 ], [原创 2015-01-27 22:50:45 · 609 阅读 · 0 评论 -
LeetCode: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原创 2015-01-27 22:11:53 · 693 阅读 · 0 评论 -
LeetCode: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 right at原创 2015-01-27 21:16:43 · 690 阅读 · 0 评论 -
LeetCode:Excel Sheet Column Number
Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ...原创 2014-12-29 17:19:51 · 811 阅读 · 0 评论 -
LeetCode:Permutations
Given a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].// Source : h原创 2014-12-26 17:58:39 · 651 阅读 · 0 评论 -
LeetCode: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原创 2014-12-26 16:35:19 · 522 阅读 · 0 评论 -
LeetCode:Best Time to Buy and Sell Stock
Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),原创 2014-12-26 16:04:56 · 749 阅读 · 0 评论 -
LeetCode:Rotate Image
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?// Source : https://oj.leetcode.com/problems/rotate原创 2014-12-25 13:40:08 · 575 阅读 · 0 评论 -
LeetCode:Find Peak Element
A peak element is an element that is greater than its neighbors.Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.The array may contain multiple peaks, in原创 2014-12-25 13:12:48 · 855 阅读 · 0 评论 -
LeetCode: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 with原创 2014-12-25 11:54:12 · 467 阅读 · 0 评论 -
LeetCode:Unique Paths
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 at any point in time. The robot is trying to reach the原创 2014-12-25 11:10:18 · 518 阅读 · 0 评论 -
LeetCode:Gray Code
The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence of原创 2014-12-25 10:36:03 · 470 阅读 · 0 评论 -
LeetCode:Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element原创 2014-12-22 18:02:43 · 3478 阅读 · 2 评论 -
LeetCode:Find Minimum 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).Find the minimum element.You may assume no duplicate exists in原创 2014-12-22 17:50:20 · 638 阅读 · 0 评论 -
LeetCode:Balanced Binary Tree
Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never diffe原创 2014-12-22 16:24:01 · 595 阅读 · 0 评论 -
LeetCode: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 integers原创 2014-12-22 14:50:59 · 533 阅读 · 0 评论 -
LeetCode: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. Y原创 2014-12-21 22:48:52 · 544 阅读 · 0 评论 -
LeetCode: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./原创 2014-12-21 22:30:57 · 576 阅读 · 0 评论 -
LeetCode:Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.// Source : https://oj.leetcode.com/problems/merge-two-原创 2014-12-21 21:45:33 · 488 阅读 · 0 评论 -
LeetCode:Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.// Source : https://oj.leetcode.com/problems/convert-sorted-array-to-binary-search-tree/// Author :原创 2014-12-21 19:58:48 · 467 阅读 · 0 评论 -
LeetCode:Integer to Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.// Source : https://oj.leetcode.com/problems/integer-to-roman/// Author : Chao Zeng/原创 2014-12-21 19:21:17 · 570 阅读 · 0 评论 -
LeetCode:Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?// Source : https://oj.leetc原创 2014-12-20 21:05:04 · 552 阅读 · 0 评论 -
LeetCode:Single Number II
Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without u原创 2014-12-20 20:11:38 · 505 阅读 · 0 评论 -
LeetCode: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]原创 2014-12-20 18:03:45 · 480 阅读 · 0 评论 -
LeetCode:Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321// Source : https://oj.leetcode.com/problems/reverse-integer/// Author : Chao Zeng// Date : 2014-原创 2014-12-20 17:36:47 · 521 阅读 · 0 评论 -
LeetCode:Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.// Source : https://oj.leetcode.com/problems/roman-to-integer/// Author : Chao Zeng/原创 2014-12-20 17:06:15 · 452 阅读 · 0 评论 -
LeetCode:Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.// Source : https://oj.原创 2014-12-20 16:18:07 · 527 阅读 · 0 评论 -
LeetCode: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.原创 2014-12-19 19:33:07 · 504 阅读 · 0 评论 -
LeetCode:Populating Next Right Pointers in Each Node
Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next right node. If t原创 2014-12-19 17:39:02 · 462 阅读 · 0 评论