摘要: Find the length of the longest substring T of a given string (consists of lowercase letters only) such that every character in T appears no less than  阅读全文
posted @ 2017-01-13 23:52 MiaBlog 阅读(322) 评论(0) 推荐(0) 编辑
摘要: Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3].... For example, given nums = [3, 5, 2, 1, 6, 4], 阅读全文
posted @ 2017-01-13 03:41 MiaBlog 阅读(289) 评论(0) 推荐(0) 编辑
摘要: Example:Given binary tree Returns [4, 5, 3], [2], [1]. Explanation: 1. Removing the leaves [4, 5, 3] would result in this tree: 2. Now removing the le 阅读全文
posted @ 2017-01-13 00:43 MiaBlog 阅读(186) 评论(0) 推荐(0) 编辑