26. Remove Duplicates from Sorted Array

LeetCode

Approach: Two Pointers, Time complextiy : O(n)

class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums.length<2) return 1;
        int j=0;
        for(int i=1;i<nums.length;i++){
            if(nums[i]!=nums[i-1]) nums[++j]=nums[i];
        }
        return ++j;
    }
}