leetcode--Remove Duplicates from Sorted Array II

转载于 2019-08-20 23:29:10 发布 · 111 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/averillzheng/p/3769799.html

本文介绍了一种在排序数组中去除重复元素的算法，允许每个元素最多出现两次。通过一次遍历和计数的方式，该算法将数组修改为不包含多余重复项的形式，并返回新的有效长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

public class Solution {
    public int removeDuplicates(int[] A) {
        int index = -1, length = A.length, mult = 0;
        if(length > 0){
        	index = 0; 
        	mult = 1;
        	int current = A[0];
        	for(int i = 1; i < length; ++i) {
        		if(current != A[i]){
        			A[++index] = A[i];
        			mult = 1;
        			current = A[i];
        		}
        		else{
        			if(mult < 2){
        				A[++index] = A[i];
        				++mult;
        			}
        		}
        	}
        }
        return index + 1; 
    }
}

转载于:https://www.cnblogs.com/averillzheng/p/3769799.html