LeetCode
文章平均质量分 74
@SmartSi
Stay Hungry, Stay Foolish
展开
-
[LeetCode]96.Unique Binary Search Trees
【题目】Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2原创 2014-12-26 21:37:53 · 2146 阅读 · 0 评论 -
[LeetCode]129.Sum Root to Leaf Numbers
【题目】Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Fin原创 2015-01-01 21:53:33 · 1560 阅读 · 0 评论 -
[LeetCode]111.Minimum Depth of Binary Tree
【题目】Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.【分析】类似于:LeetCode之Maxim原创 2014-12-30 11:14:57 · 1622 阅读 · 0 评论 -
[LeetCode]117.Populating Next Right Pointers in Each Node II
【题目】Follow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any binary tree? Would your previous solution still work?Note:You may only use原创 2014-12-24 19:05:53 · 1586 阅读 · 0 评论 -
[LeetCode]102.Binary Tree Level Order Traversal
【题目】Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \原创 2014-12-08 10:38:36 · 1733 阅读 · 0 评论 -
[LeetCode]144.Binary Tree Preorder Traversal
【题目】Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recu原创 2014-10-15 21:51:08 · 2017 阅读 · 1 评论 -
[LeetCode]100.Same Tree
【题目】Same Tree Total Accepted: 4943 Total Submissions: 11464My SubmissionsGiven two binary trees, write a function to check if they are equal or not.Two binary trees are conside原创 2013-12-08 12:50:14 · 2349 阅读 · 0 评论 -
[LeetCode]104.Maximum Depth of Binary Tree
【题目】Maximum Depth of Binary Tree Total Accepted: 5260 Total Submissions: 11532My SubmissionsGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes原创 2013-12-08 11:04:12 · 2355 阅读 · 0 评论 -
[LeetCode]98.Validate Binary Search Tree
【题目】Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the nod原创 2014-12-27 17:28:33 · 1745 阅读 · 0 评论 -
[LeetCode]116.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 nex原创 2014-12-24 18:52:37 · 1490 阅读 · 0 评论 -
[LeetCode]145.Binary Tree Postorder Traversal
【题目】Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1].Note: Recursi原创 2014-12-07 17:16:38 · 1695 阅读 · 0 评论 -
[LeetCode]203.Remove Linked List Elements
Remove all elements from a linked list of integers that have value val.Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –> 5原创 2015-05-02 08:43:43 · 1812 阅读 · 0 评论 -
[LeetCode]118.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] ]思路模拟代码 /**----------------原创 2015-02-06 11:35:58 · 1740 阅读 · 0 评论 -
[LeetCode]74.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 integ原创 2015-02-04 14:54:03 · 1688 阅读 · 0 评论 -
[LeetCode]162.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 multipl原创 2015-02-01 15:56:50 · 1601 阅读 · 0 评论 -
[LeetCode]29.Divide Two Integers
【题目】Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.【分析】不能用乘除和取模,就只能用加减和位运算。最简单的方法就是不断的减去被除数。这种方法的迭代次数是结果的大小,即比如结果为n,算法复杂度原创 2015-01-25 10:41:25 · 2649 阅读 · 0 评论 -
[LeetCode]30.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 an原创 2015-01-25 18:26:39 · 1562 阅读 · 0 评论 -
[LeetCode]38.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 re原创 2015-01-27 11:42:49 · 1656 阅读 · 0 评论 -
[LeetCode]39.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 unli原创 2015-01-27 17:47:03 · 3591 阅读 · 0 评论 -
[LeetCode]179.Largest Number
【题目】Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.Note: The result原创 2015-01-18 13:55:44 · 2026 阅读 · 0 评论 -
[LeetCode]47.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], an原创 2015-01-19 12:21:00 · 2389 阅读 · 1 评论 -
[LeetCode]34.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原创 2015-01-24 12:41:19 · 1945 阅读 · 0 评论 -
[LeetCode]11.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,原创 2015-01-21 15:45:44 · 1789 阅读 · 0 评论 -
[LeetCode]169.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 majorit原创 2015-01-30 15:48:51 · 1961 阅读 · 0 评论 -
[LeetCode]53.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,原创 2015-01-27 20:23:55 · 2680 阅读 · 0 评论 -
[LeetCode]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 be if it were inserted in order.You may assume no duplicates in原创 2015-01-24 15:07:12 · 2183 阅读 · 0 评论 -
[LeetCode]22.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-01-23 22:34:15 · 1562 阅读 · 0 评论 -
[LeetCode]75.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原创 2015-02-03 09:21:56 · 1633 阅读 · 0 评论 -
[LeetCode]12.Integer to Roman
【题目】Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.【分析】I = 1;V = 5;X = 10;L = 50;C = 100;D = 500;M = 1000;还有一些特原创 2015-01-21 17:58:00 · 1641 阅读 · 0 评论 -
[LeetCode]67.Add Binary
【题目】Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".【题意】给定两个二进制字符串,返回它们的和(也是一个二进制字符串)。【分析】类似大数加法【代码】/***********原创 2014-02-05 16:20:27 · 2195 阅读 · 0 评论 -
[LeetCode]54.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,原创 2015-02-05 10:59:12 · 1518 阅读 · 0 评论 -
[LeetCode]31.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 lowes原创 2015-01-16 12:03:30 · 2233 阅读 · 0 评论 -
[LeetCode]141.Linked List Cycle
【题目】Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?【题意】给定一个链表,确定它是否包含一个环。【分析】最容易想到的方法是,用一个哈希表 unordered_map visited,记原创 2014-01-31 17:46:32 · 2285 阅读 · 0 评论 -
[LeetCode]61.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.【题意】给定一个链表,向右旋转k个位置,其中k原创 2014-01-29 14:04:26 · 2382 阅读 · 0 评论 -
[LeetCode]86.Partition List
【题目】Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes原创 2014-01-28 12:28:43 · 2075 阅读 · 0 评论 -
[LeetCode]143.Reorder List
【题目】Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Given {1,2,3,4}, reor原创 2014-01-31 23:05:04 · 2084 阅读 · 0 评论 -
[LeetCode]160.Intersection of Two Linked Lists
【题目】Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a1 → a2 ↘原创 2015-02-01 20:06:27 · 1503 阅读 · 0 评论 -
[LeetCode]24.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 constan原创 2014-01-29 17:02:41 · 2056 阅读 · 0 评论 -
[LeetCode]56.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].【分析】(1)先将目标区间数组按X轴从小到大排序。例如:[2,3] [1,2]原创 2015-01-14 20:39:18 · 2120 阅读 · 0 评论 -
[LeetCode]9.Palindrome Number
【题目】Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of原创 2015-01-20 20:43:34 · 1740 阅读 · 0 评论