- 博客(3)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 LeetCode Search in Rotated Sorted Array
Description: 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 value to sea
2018-02-07 15:26:49
98
原创 LeetCode Remove Duplicates from Sorted Array II
描述： 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 should return length = 5, and A is now [1,1,2,2
2018-02-07 11:38:33
86
原创 LeetCode Remove Duplicates from Sorted Array
2.1.1 Remove Duplicates from Sorted Array 描述 Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for
2018-02-07 11:32:47
117
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人