2014年5月20日
【LeetCode】Recover Binary Search Tree
摘要： Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is ... 阅读全文
posted @ 2014-05-20 22:36 一弦一仙 阅读(128) 评论(0) 推荐(0) 编辑
【LeetCode】Evaluate Reverse Polish Notation
摘要： Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another express... 阅读全文
posted @ 2014-05-20 14:24 一弦一仙 阅读(171) 评论(0) 推荐(0) 编辑