2015年4月23日
Binary Tree Inorder Traversal ——LeetCode
摘要： Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note... 阅读全文
posted @ 2015-04-23 21:40 丶Blank 阅读(168) 评论(0) 推荐(0)
Maximum Product Subarray——LeetCode
摘要： Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],the... 阅读全文
posted @ 2015-04-23 16:37 丶Blank 阅读(179) 评论(0) 推荐(0)
Remove Linked List Elements——LeetCode
摘要： Remove all elements from a linked list of integers that have valueval.ExampleGiven:1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6,val= 6Return:1 --> 2 --> 3 --... 阅读全文
posted @ 2015-04-23 12:54 丶Blank 阅读(139) 评论(0) 推荐(0)
Maximum Subarray——LeetCode
摘要： Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−2,1,−3,4,−1,2,1,... 阅读全文
posted @ 2015-04-23 11:27 丶Blank 阅读(138) 评论(0) 推荐(0)