LeetCode
joannae_hu
这个作者很懒,什么都没留下…
展开
-
Convert Sorted Array to Binary Search Tree
-----QUESTION-----Given an array where elements are sorted in ascending order, convert it to a height balanced BST.-----SOLUTION-----原创 2014-07-25 21:23:49 · 262 阅读 · 0 评论 -
Binary Tree Level Order Traversal II
-----QUESTION-----Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary原创 2014-07-25 21:24:24 · 286 阅读 · 0 评论 -
Construct Binary Tree from Inorder and Postorder Traversal
-----QUESTION-----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-----struct TreeN原创 2014-07-25 21:32:27 · 280 阅读 · 0 评论 -
Construct Binary Tree from Preorder and Inorder Traversal
-----QUESTION-----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-----class Solut原创 2014-07-25 21:34:23 · 240 阅读 · 0 评论 -
Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).原创 2014-07-30 13:58:39 · 457 阅读 · 0 评论 -
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原创 2014-07-30 14:11:09 · 615 阅读 · 0 评论 -
Binary Tree Inorder Traversal
-----QUESTION-----Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,3,2].Note: Recursive原创 2014-07-30 15:02:46 · 279 阅读 · 0 评论 -
Binary Tree Zigzag Level Order Traversal
-----QUESTION-----Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).F原创 2014-07-30 13:43:56 · 240 阅读 · 0 评论 -
Binary Tree Level Order Traversal
-----QUESTION------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},原创 2014-07-30 13:46:03 · 249 阅读 · 0 评论 -
Same Tree
-----QUESTION-----Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the s原创 2014-07-30 14:10:02 · 309 阅读 · 0 评论 -
Validate Binary Search Tree
-----QUESTION-----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 l原创 2014-07-30 14:51:46 · 323 阅读 · 0 评论 -
Interleaving String
-----QUESTION-----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原创 2014-07-30 14:52:33 · 312 阅读 · 0 评论 -
Unique Binary Search Trees
-----QUESTION-----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 1原创 2014-07-30 14:59:41 · 289 阅读 · 0 评论 -
Unique Binary Search Trees II
------QUESTION------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原创 2014-07-30 15:00:34 · 229 阅读 · 0 评论 -
Maximum Depth of Binary Tree
-----QUESTION-----Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.-----SOLUTIO原创 2014-07-30 11:07:18 · 349 阅读 · 0 评论 -
Restore IP Addresses
-----QUESTION-----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",原创 2014-07-30 15:16:09 · 227 阅读 · 0 评论 -
Reverse Linked List II
-----QUESTION-----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.原创 2014-07-30 15:33:44 · 325 阅读 · 0 评论 -
Merge Sorted Array
-----QUESTION-----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 to hold additional elements from B. The number of原创 2014-07-30 15:47:17 · 261 阅读 · 0 评论 -
Subsets II
-----QUESTION-----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 solu原创 2014-07-30 15:32:10 · 213 阅读 · 0 评论 -
Scramble String
-----QUESTION-----Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = "great":原创 2014-07-30 15:48:25 · 489 阅读 · 0 评论 -
Largest Rectangle in Histogram
-----QUESTION-----Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Rectangle in His原创 2014-07-30 16:23:45 · 338 阅读 · 0 评论 -
Decode Ways
-----QUESTION-----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原创 2014-07-30 15:42:34 · 289 阅读 · 0 评论 -
Remove Duplicates from Sorted Array
-----QUESTION-----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原创 2014-07-31 13:53:17 · 288 阅读 · 0 评论 -
Remove Duplicates from Sorted Array II
-----QUESTION-----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 =原创 2014-07-31 13:54:22 · 327 阅读 · 0 评论 -
Word Search
Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more th原创 2014-07-31 13:52:48 · 529 阅读 · 0 评论 -
Subsets
-----QUESTION-----Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order. The solution set must not contain du原创 2014-07-31 13:58:48 · 257 阅读 · 0 评论 -
Combinations
-----QUESTION-----Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3], [原创 2014-07-31 13:59:04 · 195 阅读 · 0 评论 -
Gray Code
------QUESTION-----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 c原创 2014-07-30 15:47:25 · 297 阅读 · 0 评论 -
Maximal Rectangle
-----QUESTION-----Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.-----SOLUTION-----class Solution {public: int maxima原创 2014-07-30 16:26:43 · 329 阅读 · 0 评论 -
Remove Duplicates from Sorted List II
-----QUESTION-----Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example,Given 1->2->3->3->4->4->5,原创 2014-07-30 16:27:56 · 437 阅读 · 0 评论 -
Remove Duplicates from Sorted List
-----QUESTION-----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原创 2014-07-30 16:26:35 · 245 阅读 · 0 评论 -
Search in Rotated Sorted Array
-----QUESTION-----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. I原创 2014-07-30 16:30:21 · 282 阅读 · 0 评论 -
Search in Rotated Sorted Array II
-----QUESTION-----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 i原创 2014-07-30 16:31:41 · 254 阅读 · 0 评论 -
Set Matrix Zeroes
-----QUESTION-----Given a m x n matrix,if an element is 0, set its entire row and column to 0. Do it inplace.Follow up:Did you use extra space?A straight forward solution using O(mn)原创 2014-09-12 15:09:25 · 383 阅读 · 0 评论 -
Palindrome Partitioning
-----QUESTION-----Given a string s,partition s suchthat every substring of the partition is a palindrome.Return all possible palindrome partitioningof s.For example, given s = "aab",原创 2014-07-25 14:34:01 · 227 阅读 · 0 评论 -
Word Ladder
-----QUESTION-----Given two words (start and end),and a dictionary, find the length of shortest transformationsequence from start to end,such that:Only one letter can be changed at a tim原创 2014-07-25 16:17:57 · 356 阅读 · 0 评论 -
Palindrome Partitioning II
-----QUESTION------Given a string s,partition s suchthat every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioningof s.For example, gi原创 2014-07-25 15:44:58 · 424 阅读 · 0 评论 -
Longest Consecutive Sequence
-----QUESTION-----Given an unsorted array of integers, find the length of the longestconsecutive elements sequence.For example,Given [100,4, 200, 1, 3, 2],The longest consecutive eleme原创 2014-07-25 16:11:52 · 213 阅读 · 0 评论 -
Word Ladder II
-----QUESTION-----Given two words (start and end),and a dictionary, find all shortest transformation sequence(s)from start to end,such that:Only one letter can be changed at a timeEach i原创 2014-07-25 16:19:44 · 303 阅读 · 0 评论 -
Valid Palindrome
-----QUESTION-----Given a string, determine if it is a palindrome, considering onlyalphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is apalindrome.原创 2014-07-25 16:31:44 · 335 阅读 · 0 评论