2015年6月11日
[LintCode] Max Tree
摘要： Max TreeGiven an integer array with no duplicates. A max tree building on this array is defined as follow:The root is the maximum number in the arrayT... 阅读全文
posted @ 2015-06-11 16:15 Eason Liu 阅读(1120) 评论(0) 推荐(0)
[LeetCode] Implement Stack using Queues
摘要： Implement Stack using QueuesImplement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the eleme... 阅读全文
posted @ 2015-06-11 11:12 Eason Liu 阅读(2098) 评论(1) 推荐(0)