描述
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]
int del2Dumplicate(int arr[], int len) { if (len == 0) { return 0; } int occur = 1; int index = 0; for (int i = 1; i < len; i++) { if (arr[index] == arr[i]) { if (occur < 2) { arr[++index] = arr[i]; occur++; } } else { arr[++index] = arr[i]; occur = 1; } } return index + 1; }