2014年11月12日
[LeetCode] Path Sum II
摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =... 阅读全文
posted @ 2014-11-12 22:20 Agentgamer 阅读(128) 评论(0) 推荐(0)
[LeetCode] Min Stack
摘要： Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes... 阅读全文
posted @ 2014-11-12 13:43 Agentgamer 阅读(154) 评论(0) 推荐(0)