Remove duplicates from sorted array II

最新推荐文章于 2023-09-22 13:35:40 发布

转载最新推荐文章于 2023-09-22 13:35:40 发布 · 251 阅读

Leetcode 同时被 3 个专栏收录

37 篇文章

订阅专栏

Array

13 篇文章

订阅专栏

Remove

4 篇文章

订阅专栏

本文探讨了在已排序数组中去除重复元素的算法改进，特别关注最多允许两个相同元素相邻的情况。通过引入变量跟踪上一次重复元素并进行优化循环，实现了在保持数组有序的同时，限制重复元素出现次数至两次。

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].

1. 引入个变量保存上次重复的值

2. for循环从2开始

public class Solution {
    public int removeDuplicates(int[] A) {
        if (A.length <= 2) return A.length;
        
        int dup = A[0];
        int size = 1;
        
        for (int i = 2; i < A.length; i++) {
            if (A[size] != A[i]) {
                A[++size] = A[i];
            }else {
                if (A[i] != dup) {
                    A[++size] = A[i];
                    dup = A[i];
                }
            }
        }
        return size+1;
    }
}