摘要: 题目内容 本题来源LeetCode Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 阅读全文
posted @ 2017-07-04 11:39 chyq 阅读(124) 评论(0) 推荐(0)
摘要: 题目内容 本题来源LeetCode Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For example, Given sorted array nums = [1,1,1,2,2,3 阅读全文
posted @ 2017-07-04 11:03 chyq 阅读(102) 评论(0) 推荐(0)