首页 > 代码库 > [leetcode] Remove Duplicates from Sorted Array II
[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,3].
https://oj.leetcode.com/problems/remove-duplicates-from-sorted-array-ii/
思路：双指针法。只不过这次是前面隔一个元素比较。
public class Solution { public int removeDuplicates(int[] A) { int n = A.length; if (n <= 2) return n; int index = 2; for (int i = 2; i < n; i++) { if (A[i] != A[index - 2]) A[index++] = A[i]; } return index; } public int removeDuplicates2(int[] A) { if (A.length <= 2) return A.length; int prev = 1; // point to previous int curr = 2; // point to current while (curr < A.length) { if (A[curr] == A[prev] && A[curr] == A[prev - 1]) { curr++; } else { prev++; A[prev] = A[curr]; curr++; } } return prev + 1; } public static void main(String[] args) { System.out.println(new Solution().removeDuplicates(new int[] { 1, 1, 1, 2 })); System.out.println(new Solution().removeDuplicates(new int[] { 1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 4, 5, 5 })); System.out.println(new Solution().removeDuplicates(new int[] {})); System.out.println(new Solution().removeDuplicates(new int[] { 1 })); System.out.println(new Solution().removeDuplicates(new int[] { 1, 1 })); }}
参考：
http://www.programcreek.com/2013/01/leetcode-remove-duplicates-from-sorted-array-ii-java/
http://zhangxc.com/2013/11/leetcode-remove-duplicates-from-sorted-array-2
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。