2016年08月_SmithZz

原创 Leetcode no. 106

106. Construct Binary Tree from Inorder and Postorder TraversalGiven inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exi

2016-08-31 21:24:46 359

原创 Leetcode no. 105

105. Construct Binary Tree from Preorder and Inorder TraversalGiven preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist

2016-08-31 19:54:29 448

原创 Leetcode no. 98

98. Validate Binary Search TreeGiven 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 no

2016-08-30 21:02:52 375

原创 Leetcode no. 329

329. Longest Increasing Path in a MatrixGiven an integer matrix, find the length of the longest increasing path.From each cell, you can either move to four directions: left, right, up or

2016-08-30 17:28:14 414

原创 Leetcode no. 128

128. Longest Consecutive SequenceGiven an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longes

2016-08-15 12:48:59 397

原创 Leetcode no. 14

14. Longest Common PrefixWrite a function to find the longest common prefix string amongst an array of strings.public class Solution { public String longestCommonPrefix(String[] st

2016-08-15 11:09:01 369

原创 Leetcode no. 45

45. Jump Game IIGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at tha

2016-08-14 17:24:33 279

原创 leetcode no. 55

55. Jump GameGiven an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that p

2016-08-14 14:35:43 352

原创 Leetcode no. 96

96. Unique Binary Search TreesGiven 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.

2016-08-11 23:58:43 374

原创 Leetcode no. 94

94. Binary Tree Inorder TraversalGiven a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree [1,null,2,3], 1 \ 2 / 3

2016-08-11 22:00:22 362

原创 Leetcode no. 67

67. Add BinaryGiven two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".public class Solution { public String addBinary(Stri

2016-08-11 21:17:26 303

原创 Leetcode no. 145

145. Binary Tree Postorder TraversalGiven a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3

2016-08-11 20:56:17 268

原创 Leetcode no. 144

144. Binary Tree Preorder TraversalGiven a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3

2016-08-11 19:42:36 275

SmithZz的博客