摘要：
Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1递归实现： 1 TreeNode* invertTree(TreeNo... 阅读全文
随笔分类 - LeetCode
[LeetCode] Search in Rotated Sorted Array
2015-07-23 22:32 by codinglol, 132 阅读, 收藏,
摘要：
题目要求： Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given ... 阅读全文
浙公网安备 33010602011771号