【删除有序数组中的重复项】

MegaDataFlowers2023-07-29 16:31

给你一个升序排列的数组 nums ，请你原地删除重复出现的元素，使每个元素只出现一次，返回删除后数组的新长度。元素的相对顺序应该保持一致。然后返回 nums 中唯一元素的个数。

nums = [0,0,1,1,1,2,2,3,3,4]
5, nums = [0,1,2,3,4]

点击跳转

c 复制代码

int removeDuplicates(int* nums, int numsSize){
    int begin = 0;
    int end = 0;
    // 0,0,1,1,1,2,2,3,3,4
//begin        0
//end                    1 
    while(end<numsSize){
        if(nums[end] == nums[begin]){
            nums[begin] = nums[end];
            end++;
        }else{
            begin++;
            nums[begin] = nums[end];
            end++;
        }
    }
    return begin+1;
}

c 复制代码

int removeDuplicates(int* nums, int numsSize){
    int begin = 0;
    int end = 0;
    // 0,0,1,1,1,2,2,3,3,4
//begin        0
//end                     1 
    while(end<numsSize){
        if(nums[end] == nums[begin]){
            // nums[begin] = nums[end];
            end++;
        }else{
            begin++;
            nums[begin] = nums[end];
            end++;
        }
    }
    return begin+1;
}

c 复制代码

int removeDuplicates(int* nums, int numsSize){
    int begin = 0;
    int end = 0;
    // 0,0,1,1,1,2,2,3,3,4
//begin        0
//end                    1 
    while(end<numsSize){
        if(nums[end] == nums[begin]){
            // nums[begin] = nums[end];
            end++;
        }else{
            begin++;
            nums[begin] = nums[end];
            // end++;
        }
    }
    return begin+1;
}

c 复制代码

int removeDuplicates(int* nums, int numsSize){
    int begin = 0;
    int end = 1;

    // [0,0,1,1,1,2,2,3,3,4]
// begin        0
// end                      1
    while(end<numsSize){
        if(nums[end] == nums[begin]){
            end++;
        }else{
            begin++;
            nums[begin] = nums[end];
            end++;
        }
    }
    return begin+1;
}