Leetcode-80.Remove Duplicates from Sorted Array II

Problem description:
Follow up for “Remove Duplicates”:
What if duplicates are allowed at most twice?
For example,
Given sorted array nums = [1,1,1,2,2,3],
Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3. It doesn’t matter what you leave beyond the new length.

---

Analysis:
It’s an extension of Remove Duplicates from Sorted Array.
The original problem 1 codes :

int removeDuplicates(vector<int>& nums) {
        int n = nums.size();
        if( n <= 1) return n;
        int j = 1;
        for (int i = 1; i < n; ++i)
        {
            if (nums[i] != nums[j - 1])
                nums[j++] = nums[i];
        }
        return j;
    }

---

The follow up problem program :
The code can be easily extended to apply 3, 4, … duplicates by modifying lines 3, 4, 5 in a similar manner.

int removeDuplicates(vector<int>& nums) {
        if (nums.size() <= 2) return nums.size();
        int pos = 1;
        for (int i = 2; i < nums.size(); i++)
            if (nums[i] != nums[pos] || nums[i] != nums[pos - 1])
                nums[++pos] = nums[i];
        return pos + 1;
    }

Complex one :

int removeDuplicates(vector<int>& nums) {
        int n = nums.size();
        if (n <= 2) return n;
        int j = 0, flag = 0;
        for (int i = 1; i < n; ++i)
        {
            if (nums[i] == nums[j] && flag == 0)
            {
                flag = 1;
                nums[++j] = nums[i];
            }
            else if (nums[i] != nums[j])
            {
                nums[++j] = nums[i];
                flag = 0;
            }
        }
        return j + 1;
    }