【LeetCode】
文章平均质量分 55
ice4026
这个作者很懒,什么都没留下…
展开
-
【LeetCode】Best Time to Buy and Sell Stock III
纯转载……和前两道题比起来的话,这道题最难了,因为限制了交易次数。解决问题的途径我想出来的是:既然最多只能完成两笔交易,而且交易之间没有重叠,那么就divide and conquer。设i从0到n-1,那么针对每一个i,看看在prices的子序列[0,...,i][i,...,n-1]上分别取得的最大利润(第一题)即可。这样初步一算,时间复杂度是O(n2)。转载 2014-05-14 15:04:52 · 376 阅读 · 0 评论 -
【LeetCode】Populating Next Right Pointers in Each Node(I and II)
题目描述:Populating Next Right Pointers in Each NodeGiven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Po转载 2014-05-15 16:30:48 · 343 阅读 · 0 评论 -
【LeetCode】Distinct Subsequences
题目描述:Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original string by deleting some原创 2014-05-16 13:20:32 · 310 阅读 · 0 评论 -
【LeetCode】Flatten Binary Tree to Linked List
题目描述:Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened tree should look like原创 2014-05-17 00:22:53 · 300 阅读 · 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原创 2014-05-17 16:40:58 · 371 阅读 · 0 评论 -
【LeetCode】Binary Tree Maximum Path Sum
题目描述;Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 / \ 2 3R原创 2014-05-12 15:46:40 · 441 阅读 · 0 评论 -
【LeetCode】Surrounded Regions
题目描述:Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.For example,X X转载 2014-05-09 01:56:14 · 347 阅读 · 0 评论 -
【LeetCode】Convert Sorted List to Binary Search Tree
题目描述:Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.将一个单向链表原创 2014-05-20 01:03:00 · 393 阅读 · 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.将一个排序好的数组zh原创 2014-05-19 21:34:07 · 442 阅读 · 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转载 2014-06-02 23:16:26 · 468 阅读 · 0 评论 -
【LeetCode】Palindrome Number
题目描述:Determine whether an integer is a palindrome. Do this without extra space.原创 2014-06-01 20:24:04 · 416 阅读 · 0 评论 -
【LeetCode】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 enti原创 2014-06-02 15:31:35 · 432 阅读 · 0 评论 -
【LeetCode】Triangle
题目描述:Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2],原创 2014-05-15 01:06:42 · 408 阅读 · 0 评论 -
【LeetCode】Construct Binary Tree from Preorder and Inorder Traversal
题目描述:Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.注意树中不存在相同的yua原创 2014-05-21 01:49:45 · 328 阅读 · 0 评论 -
【LeetCode】Construct Binary Tree from Inorder and Postorder Traversal
题目描述:Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.原创 2014-05-21 13:35:51 · 344 阅读 · 0 评论 -
【LeetCode】Symmetric Tree
题目描述:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3原创 2014-05-21 16:13:46 · 329 阅读 · 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.思路是从字符串的youbian原创 2014-06-03 21:49:39 · 491 阅读 · 0 评论 -
【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 h原创 2014-06-03 22:27:45 · 450 阅读 · 0 评论 -
【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:原创 2014-06-04 02:09:51 · 429 阅读 · 0 评论 -
【LeetCode】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 t原创 2014-06-04 02:32:58 · 359 阅读 · 0 评论 -
【LeetCode】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 no原创 2014-05-22 00:15:14 · 345 阅读 · 0 评论 -
【LeetCode】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 "()[]{}" a原创 2014-06-04 03:00:13 · 502 阅读 · 0 评论 -
【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 tri原创 2014-06-03 21:37:36 · 524 阅读 · 0 评论 -
【LeetCode】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:"((()))", "(()())", "(())()", "()(原创 2014-06-04 23:33:03 · 383 阅读 · 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 consta原创 2014-06-05 13:31:10 · 376 阅读 · 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 l原创 2014-06-05 17:54:14 · 306 阅读 · 0 评论 -
【LeetCode】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 rema原创 2014-06-05 14:59:31 · 431 阅读 · 0 评论 -
【LeetCode】Merge k Sorted Lists
题目描述:Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.对k个链表ji原创 2014-06-05 01:30:26 · 351 阅读 · 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原创 2014-06-05 15:13:29 · 324 阅读 · 0 评论 -
【LeetCode】Unique Binary Search Trees II
题目描述:Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown below. 1原创 2014-05-23 23:07:06 · 324 阅读 · 0 评论 -
【LeetCode】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-05-23 21:17:24 · 363 阅读 · 0 评论 -
【LeetCode】【求助】Recover Binary Search Tree
题目描述:Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is pretty straight forward. Coul原创 2014-05-23 11:07:51 · 409 阅读 · 0 评论 -
【LeetCode】Reverse Linked List II
题目描述:Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note:Given m,原创 2014-05-24 15:54:59 · 345 阅读 · 0 评论 -
【LeetCode】Subsets II
题目描述:Given a collection of integers that might contain duplicates, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not co原创 2014-05-24 22:29:17 · 404 阅读 · 0 评论 -
【LeetCode】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原创 2014-06-08 11:28:46 · 339 阅读 · 0 评论 -
【LeecCode】Implement strStr()
题目描述:Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.原创 2014-06-07 14:54:16 · 407 阅读 · 0 评论 -
【LeetCode】Restore IP Addresses
题目描述:Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255.255.11.135", "255.255.111.35原创 2014-05-24 14:40:46 · 357 阅读 · 0 评论 -
【LeetCode】Interleaving String
题目描述:Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", return true.When s3 = "aadbb转载 2014-05-24 01:55:08 · 301 阅读 · 0 评论 -
【LeetCode】Divide Two Integers
题目描述:Divide two integers without using multiplication, division and mod operator.原创 2014-06-07 16:26:48 · 391 阅读 · 0 评论 -
【LeetCode】Decode Ways
题目描述:A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine t原创 2014-05-25 03:26:54 · 307 阅读 · 0 评论