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