随笔分类 -  LeetCode

1 2 3 4 5 ··· 8 下一页
[LeetCode]Word Ladder II
摘要：Given two words (startandend), and a dictionary, find all shortest transformation sequence(s) fromstarttoend, such that:Only one letter can be changed at a timeEach intermediate word must exist in the dictionaryFor example,Given:start="hit"end="cog"dict=["hot","dot 阅读全文
posted @ 2014-03-13 13:35 七年之后 阅读(236) 评论(0) 推荐(0)
[LeetCode]Word Ladder
摘要：Given two words (startandend), and a dictionary, find the length of shortest transformation sequence fromstarttoend, such that:Only one letter can be changed at a timeEach intermediate word must exist in the dictionaryFor example,Given:start="hit"end="cog"dict=["hot",&q 阅读全文
posted @ 2014-03-13 13:33 七年之后 阅读(229) 评论(0) 推荐(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, 3, 4]. Return its length:4.Your algorithm should run in O(n) complexity.思考：空间换时间，查找O(1)用unordered_set。class Sol 阅读全文
posted @ 2014-03-13 09:56 七年之后 阅读(206) 评论(0) 推荐(0)
[LeetCode]Palindrome Partitioning II
摘要：Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs.For example, givens="aab",Return1since the palindrome partitioning["aa","b"]could be produced using 1 cut.class Solutio 阅读全文
posted @ 2014-03-12 22:10 七年之后 阅读(155) 评论(0) 推荐(0)
[LeetCode]Palindrome Partitioning
摘要：Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, givens="aab",Return [ ["aa","b"], ["a","a","b"] ]class Solution {private: vector > res;pub 阅读全文
posted @ 2014-03-12 21:27 七年之后 阅读(132) 评论(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 possible sentences.For example, givens="catsanddog",dict=["cat", "cats", "and", "sand", "dog"].A 阅读全文
posted @ 2014-03-12 20:36 七年之后 阅读(167) 评论(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-12 20:26 七年之后 阅读(163) 评论(0) 推荐(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"]. (Order does not matter)class Solution {private: vector ret; int pos[4];public: bool check 阅读全文
posted @ 2014-03-12 12:24 七年之后 阅读(181) 评论(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 tree should look like: 1 \ 2 \ 3 \ 4 \ 5 \ 6click to show hints.Hints:If y... 阅读全文
posted @ 2014-03-12 11:25 七年之后 阅读(230) 评论(0) 推荐(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./** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; *//** * Definition for binary tree * struc... 阅读全文
posted @ 2014-03-12 10:22 七年之后 阅读(179) 评论(0) 推荐(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./** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: ... 阅读全文
posted @ 2014-03-11 22:41 七年之后 阅读(132) 评论(0) 推荐(0)
[LeetCode]Binary Tree Level Order Traversal II
摘要：Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree{3,9,20,#,#,15,7}, 3 / \ 9 20 / \ 15 7return its bottom-up level order traversal as:[ [15,7] [9,20], [3],]conf... 阅读全文
posted @ 2014-03-11 21:38 七年之后 阅读(131) 评论(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.Have you been asked this question in an interview?Yes/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right... 阅读全文
posted @ 2014-03-11 21:04 七年之后 阅读(144) 评论(0) 推荐(0)
[LeetCode]Distinct Subsequences
摘要：Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from the orig... 阅读全文
posted @ 2014-03-11 19:39 七年之后 阅读(160) 评论(0) 推荐(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.Have you been asked this question in an interview?Yes/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right;... 阅读全文
posted @ 2014-03-11 19:30 七年之后 阅读(150) 评论(0) 推荐(0)
[LeetCode]Decode Ways
摘要：A message containing letters fromA-Zis being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine the total number of ways to decode it.For example,Given encoded message"12", it cou 阅读全文
posted @ 2014-03-11 16:12 七年之后 阅读(111) 评论(0) 推荐(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 integernrepresenting the total number of bits in the code, print the sequence of gray code. A gray code sequence must begin with 0.For example, givenn= 2, return[0,1,3,2]. Its gray code s 阅读全文
posted @ 2014-03-11 13:12 七年之后 阅读(122) 评论(0) 推荐(0)
[LeetCode]Scramble String
摘要：Given a strings1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation ofs1="great": great / \ gr eat / \ / \g r e at / \ a tTo scramble the string, we may choose any non-leaf no... 阅读全文
posted @ 2014-03-11 11:35 七年之后 阅读(169) 评论(0) 推荐(0)
[LeetCode]Unique Binary Search Trees
摘要：Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's.1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ \ 2 1 ... 阅读全文
posted @ 2014-03-10 17:07 七年之后 阅读(162) 评论(0) 推荐(0)
[LeetCode]Best Time to Buy and Sell Stock III
摘要：Say 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 mosttwotransactions.Note:You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).Have you be 阅读全文
posted @ 2014-03-10 12:18 七年之后 阅读(175) 评论(0) 推荐(0)

1 2 3 4 5 ··· 8 下一页