leetcode - Remove Duplicates from Sorted Array II

Posted wgwyanfs

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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].

class Solution {
public:
    int removeDuplicates(int A[], int n) {
		if(n < 2) return n;
		int m = 2;
		for (int i = 2; i < n; i++)
		{
			if(A[m-2] != A[m-1] || A[m-2] != A[i])
			{
				A[m++] = A[i];
			}
		}
#if 0
		std::cout << m << std::endl;
		for (int i = 0; i < m; i++)
		{
			std::cout << A[i] << " ";
		}
		std::cout << std::endl;
#endif // 1

		return m;
    }
};






以上是关于leetcode - Remove Duplicates from Sorted Array II的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode Remove Element

Leetcode.27 | Remove Element(Python)

LeetCode 546. Remove Boxes

leetcode 27 Remove Element

[Leetcode] 27 Remove Element

LeetCode OJ 27. Remove Element