摘要: 描述 Follow up for ”Search in Rotated Sorted Array”: What if duplicates are allowed? Would this affect the run-time complexity? How and why? Write a fun 阅读全文
posted @ 2016-05-01 21:34 牧马人夏峥 阅读(131) 评论(0) 推荐(0)
摘要: 描述 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 a target 阅读全文
posted @ 2016-05-01 21:10 牧马人夏峥 阅读(133) 评论(0) 推荐(0)
摘要: 描述 Follow up for ”Remove Duplicates”: What if duplicates are allowed at most twice? For example, Given sorted array A = [1,1,1,2,2,3], Your function s 阅读全文
posted @ 2016-05-01 20:30 牧马人夏峥 阅读(121) 评论(0) 推荐(0)
摘要: 删除数组中的重复元素并返回新数组的个数 思路:保留不同的元素即可。 阅读全文
posted @ 2016-05-01 19:56 牧马人夏峥 阅读(117) 评论(0) 推荐(0)