submit_homework-优快云博客

原创 [hard]145. Binary Tree Postorder Traversal

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-11-08 20:41:03 305

原创 [hard]312. Burst Balloons

312. Burst BalloonsGiven n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst b

2016-11-08 20:21:24 226

原创 [hard]97. Interleaving String

97. Interleaving StringGiven 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.

2016-11-08 14:23:32 234

原创 [hard]295. Find Median from Data Stream

295. Find Median from Data StreamMedian is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle val

2016-11-08 14:00:06 222

原创 [hard]42. Trapping Rain Water

42. Trapping Rain WaterGiven n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.For example, Gi

2016-11-07 21:03:52 215

原创 [hard]57. Insert Interval

57. Insert IntervalGiven a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according t

2016-11-07 20:18:54 250

原创 [hard]450. Delete Node in a BST

450. Delete Node in a BSTGiven a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST.Basically

2016-11-07 19:51:39 273

原创 [hard]273. Integer to English Words

273. Integer to English WordsConvert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1.For example,123 -> "One Hundred Twenty

2016-11-07 19:09:43 291

原创 [hard]41. First Missing Positive

41. First Missing PositiveGiven an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should ru

2016-09-08 11:14:35 182

原创 [hard]76. Minimum Window Substring

76. Minimum Window SubstringGiven a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T =

2016-09-08 10:14:39 217

原创 [hard]146. LRU Cache

146. LRU CacheDesign and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be posi

2016-09-08 10:04:58 282

submit_homework的博客