Comments for Linchi is coding
https://linchicoding.wordpress.com
My coding notesSun, 28 Sep 2014 10:08:09 +0000hourly1http://wordpress.com/Comment on Leetcode–Best Time to Buy and Sell Stock II by Leetcode–Best Time to Buy and Sell Stock III | Linchi is coding
https://linchicoding.wordpress.com/2014/09/28/leetcode-best-time-to-buy-and-sell-stock-ii/comment-page-1/#comment-19
Sun, 28 Sep 2014 10:08:09 +0000http://linchicoding.wordpress.com/?p=211#comment-19[…] used a brutal force way to call maxProfit (similar function as in Best Time to Buy and Sell Stock II) to get each of max profit of two halves. Then I realized actually if we store the max profit as […]

]]>Comment on Leetcode–Unique Binary Search Trees by Leetcode–Unique Binary Search Trees II | Linchi is coding
https://linchicoding.wordpress.com/2014/09/10/leetcode-unique-binary-search-trees/comment-page-1/#comment-17
Wed, 10 Sep 2014 23:45:31 +0000http://linchicoding.wordpress.com/2014/09/10/leetcode-unique-binary-search-trees/#comment-17[…] observation as Unique Binary Search Trees : for each i being the root, it has left subtrees of the number as i-1 nodes unique BST , its has […]

]]>Comment on Leetcode–Binary Tree Postorder Traversal by Linchi is coding
https://linchicoding.wordpress.com/2014/09/08/leetcode-binary-tree-postorder-traversal/comment-page-1/#comment-16
Mon, 08 Sep 2014 05:47:15 +0000http://linchicoding.wordpress.com/2014/09/08/leetcode-binary-tree-postorder-traversal/#comment-16[…] iterative solution, similar to Binary Tree Postorder Traversal, traverse down to get left most leaf and then up, and check the relationship between previous node […]

]]>Comment on Leetcode–Binary Tree Postorder Traversal by Leetcode–Binary Tree Preorder Traversal | Linchi is coding
https://linchicoding.wordpress.com/2014/09/08/leetcode-binary-tree-postorder-traversal/comment-page-1/#comment-15
Mon, 08 Sep 2014 01:50:37 +0000http://linchicoding.wordpress.com/2014/09/08/leetcode-binary-tree-postorder-traversal/#comment-15[…] iterative solution, similar to Binary Tree Postorder Traversal, traverse down to get left most leaf and then up, and check the relationship between previous node […]

]]>Comment on Leetcode–Convert Sorted Array to Binary Search Tree by Leetcode–Convert Sorted List to Binary Search Tree | Linchi is coding
https://linchicoding.wordpress.com/2014/09/06/leetcode-convert-sorted-array-to-binary-search-tree/comment-page-1/#comment-14
Sat, 06 Sep 2014 22:42:00 +0000http://linchicoding.wordpress.com/2014/09/06/leetcode-convert-sorted-array-to-binary-search-tree/#comment-14[…] to Convert Sorted Array to Binary Search Tree, but in this problem we don’t have easy access to the middle […]

]]>Comment on Leetcode–Sqrt(x) by Leetcode–Search Insert Position | Linchi is coding
https://linchicoding.wordpress.com/2014/09/03/leetcode-sqrtx/comment-page-1/#comment-13
Thu, 04 Sep 2014 00:30:38 +0000http://linchicoding.wordpress.com/2014/09/03/leetcode-sqrtx/#comment-13[…] Attention to return low or high, also see in Sqrt(x) […]

]]>Comment on Leetcode–pow(x, n) by Leetcode–Sqrt(x) | Linchi is coding
https://linchicoding.wordpress.com/2014/09/02/leetcode-powx-n/comment-page-1/#comment-12
Wed, 03 Sep 2014 23:13:56 +0000http://linchicoding.wordpress.com/2014/09/02/leetcode-powx-n/#comment-12[…] Divide two integers and Pow(x,n), a math problem in face is a search problem, here we use binary […]

]]>Comment on Leetcode–Divide Two Integers by Leetcode–Sqrt(x) | Linchi is coding
https://linchicoding.wordpress.com/2014/09/02/leetcode-divide-two-integers/comment-page-1/#comment-11
Wed, 03 Sep 2014 23:13:54 +0000http://linchicoding.wordpress.com/2014/09/02/leetcode-divide-two-integers/#comment-11[…] Divide two integers and Pow(x,n), a math problem in face is a search problem, here we use binary […]

]]>Comment on Leetcode–Search in Rotated Sorted Array by Leetcode–Search in Rotated Sorted Array II | Linchi is coding
https://linchicoding.wordpress.com/2014/09/02/leetcode-search-in-rotated-sorted-array/comment-page-1/#comment-10
Tue, 02 Sep 2014 02:24:27 +0000http://linchicoding.wordpress.com/2014/09/02/leetcode-search-in-rotated-sorted-array/#comment-10[…] up for “Search in Rotated Sorted Array”: What if duplicates are […]

]]>Comment on Leetcode–Combinations by Leetcode–Letter Combinations of a Phone Number | Linchi is coding
https://linchicoding.wordpress.com/2014/09/01/leetcode-combinations/comment-page-1/#comment-9
Mon, 01 Sep 2014 09:22:37 +0000http://linchicoding.wordpress.com/2014/09/01/leetcode-combinations/#comment-9[…] to Combinations, just list every […]