2014年11月23日
【leetcode】Subsets (Medium) ☆
摘要： Given a set of distinct integers,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not co... 阅读全文
posted @ 2014-11-23 16:58 匡子语 阅读(239) 评论(0) 推荐(0)
【leetcode】Binary Tree Postorder Traversal (hard) ☆
摘要： 二叉树的后序遍历用标记右子树vector的方法vector postorderTraversal(TreeNode *root) { vector ans; vector stack; vector isRight; stack.push_b... 阅读全文
posted @ 2014-11-23 14:57 匡子语 阅读(253) 评论(0) 推荐(0)
【leetcode】Minimum Depth of Binary Tree (easy)
摘要： Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest le... 阅读全文
posted @ 2014-11-23 13:08 匡子语 阅读(198) 评论(0) 推荐(0)
【leetcode】Plus One (easy)
摘要： Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at... 阅读全文
posted @ 2014-11-23 12:49 匡子语 阅读(221) 评论(0) 推荐(0)