26. 删除有序数组中的重复项

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

day01

class Solution {
    public int removeDuplicates(int[] nums) {
        int a = 1;
        for(int i = 0; i < nums.length-1; i++){
            if(nums[i]==nums[i+1]){
//如果两数相等那么取原来的顺序不进行往后累加
                nums[i]=nums[a];
            }else{
//两数不同时获取下标+1
                nums[a] = nums[i+1];
                a++;
            }
        }
        return a;
}
}