随笔分类 -  LeetCode

1 2 3 4 5 下一页
[LeetCode] Count and Say
摘要：The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as"one 1"or11.11is read off as"tw... 阅读全文
posted @ 2014-07-12 22:04 xchangcheng 阅读(165) 评论(0) 推荐(0)
[LeetCode] Best Time to Buy and Sell Stock III
摘要：ay you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete at... 阅读全文
posted @ 2014-07-12 21:23 xchangcheng 阅读(194) 评论(0) 推荐(0)
[LeetCode] Combination Sum II
摘要：Combination Sum IIGiven a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sum... 阅读全文
posted @ 2014-07-09 22:40 xchangcheng 阅读(126) 评论(0) 推荐(0)
[LeetCode] Combination Sum
摘要：Combination SumGiven a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thes... 阅读全文
posted @ 2014-07-05 23:11 xchangcheng 阅读(106) 评论(0) 推荐(0)
[LeetCode] Word Break II
摘要：Given a stringsand a dictionary of wordsdict, add spaces insto construct a sentence where each word is a valid dictionary word.Return all such possibl... 阅读全文
posted @ 2014-07-05 20:15 xchangcheng 阅读(180) 评论(0) 推荐(0)
[LeetCode] N-Queens
摘要：N-QueensTotal Accepted:9970Total Submissions:38919My SubmissionsThen-queens puzzle is the problem of placingnqueens on ann×nchessboard such that no tw... 阅读全文
posted @ 2014-07-05 07:45 xchangcheng 阅读(203) 评论(0) 推荐(0)
[LeetCode] N-Queens II
摘要：N-Queens IIFollow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.solution:#includ... 阅读全文
posted @ 2014-07-05 07:43 xchangcheng 阅读(146) 评论(0) 推荐(0)
[LeetCode] Word Break
摘要：Given a stringsand a dictionary of wordsdict, determine ifscan be segmented into a space-separated sequence of one or more dictionary words.For exampl... 阅读全文
posted @ 2014-07-05 07:40 xchangcheng 阅读(170) 评论(0) 推荐(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.Solution:public class Solution { public S... 阅读全文
posted @ 2014-04-24 22:21 xchangcheng 阅读(109) 评论(0) 推荐(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.Solution:class Solution {public: int roma... 阅读全文
posted @ 2014-04-24 22:18 xchangcheng 阅读(135) 评论(0) 推荐(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 t... 阅读全文
posted @ 2014-04-24 22:11 xchangcheng 阅读(181) 评论(0) 推荐(0)
[LeetCode] LRU Cache [Forward]
摘要：Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get the valu... 阅读全文
posted @ 2014-04-18 19:10 xchangcheng 阅读(179) 评论(0) 推荐(0)
[LeetCode] Reorder List
摘要：Given a singly linked listL: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 exam... 阅读全文
posted @ 2014-04-18 14:37 xchangcheng 阅读(172) 评论(0) 推荐(0)
[LeetCode] Max Points on a Line
摘要：Givennpoints on a 2D plane, find the maximum number of points that lie on the same straight line.Solution:/** * Definition for a point. * struct Point... 阅读全文
posted @ 2014-04-17 20:30 xchangcheng 阅读(167) 评论(0) 推荐(0)
[LeetCode] String to Integer (atoi)
摘要：Implementatoito 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 cases.Notes:It is intended for this problem to be specified vaguely (ie, no given input specs). You are respo 阅读全文
posted @ 2014-04-01 22:23 xchangcheng 阅读(242) 评论(0) 推荐(0)
[LeetCode] 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. For "bbbbb" the longest substring is "b", with the length of 1.S 阅读全文
posted @ 2014-04-01 21:45 xchangcheng 阅读(227) 评论(0) 推荐(0)
[LeetCode] Unique Binary Search Trees II
摘要：Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 unique BST's shown below. 1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ ... 阅读全文
posted @ 2014-03-24 09:41 xchangcheng 阅读(162) 评论(0) 推荐(0)
[LeetCode] Construct Binary Tree from Inorder and Pretorder 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.Solution:/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL),... 阅读全文
posted @ 2014-03-23 23:17 xchangcheng 阅读(153) 评论(0) 推荐(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.Solution:/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL)... 阅读全文
posted @ 2014-03-23 22:20 xchangcheng 阅读(121) 评论(0) 推荐(0)
[LeetCode] Candy
摘要：There areNchildren standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least one candy.Children with a higher rating get more candies than their neighbors.What is the minimum candies you mu 阅读全文
posted @ 2014-03-22 21:09 xchangcheng 阅读(553) 评论(0) 推荐(0)

1 2 3 4 5 下一页