【LeetCode-每日一题】

public class Solution {
    public int removeDuplicates(int[] nums) {
        int n=nums.length,left=0,right=1;
        for (int right=1;right<n;right++){
            if (nums[left]!=nums[right]){
                left++;
                nums[left]=nums[right];
            }
        }
        return left+1;
    }
}