26. delete duplicates of ordered array

Main idea

• Different adjacent elements can be directly covered , Just keep going down , Use one count Record that the array does not repeat the element subscript at this time
• Every cover , count++

Details :

class Solution {
    
    public int removeDuplicates(int[] nums) {
    
        
        //  The following element overrides the previous element ,  Two adjacent elements with different values are overwritten 
        int count = 0;
        for(int i = 0; i < nums.length; i++) {
    
            if (i == 0 || nums[i] != nums[i - 1]) {
    
                nums[count] = nums[i];
                count++;
            }
        }
        return count;
    }
}

You can see the code above , Boundary part only count and i , about count Come on , The maximum is nums The length of , So it won't cross the border . But for i Come on i Initial value by 0 , And at the beginning 0 No. element should also be put into the array , And after that i > 0 Satisfy Conditions

therefore One more i == 0 The boundary conditions of