LeetCode 27.Remove Element(移除元素) -- c语言_solution.c: in function ‘removeelement’ line 11: c-CSDN博客

本文链接：https://blog.csdn.net/d_benhua/article/details/90724545

博客围绕LeetCode 27题移除元素展开，题目要求在不额外分配数组空间的情况下，原地移除数组中指定值的元素并返回新长度。解题思路是利用双下标i、k将数组分为待返回区和待遍历区，根据元素值是否等于指定值进行不同操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

27.Remove Element

Given an array nums and a value val, remove all instances of that value in-place and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

The order of elements can be changed. It doesn't matter what you leave beyond the new length.

Example 1:

Given nums = [3,2,2,3], val = 3,

Your function should return length = 2, with the first two elements of nums being 2.

It doesn't matter what you leave beyond the returned length.

Example 2:

Given nums = [0,1,2,2,3,0,4,2], val = 2,

Your function should return length = 5, with the first five elements of numscontaining 0, 1, 3, 0, and 4.

Note that the order of those five elements can be arbitrary.

It doesn't matter what values are set beyond the returned length.

Clarification:

Confused why the returned value is an integer but your answer is an array?

Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.

Internally you can think of this:

// nums is passed in by reference. (i.e., without making a copy)
int len = removeElement(nums, val);

// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {
    print(nums[i]);
}

解题思路：

利用双下标i、k将数组分为待返回区和待遍历区。其中i为工作下标，用于遍历数组，k为待返回区最后最后一个元素的下一个位置下标，即为待返回区长度

/*
执行用时 : 4 ms, 在Remove Element的C提交中击败了98.22% 的用户
内存消耗 : 7.3 MB, 在Remove Element的C提交中击败了73.45% 的用户
*/
int removeElement(int* nums, int numsSize, int val){
    
    int i,k=0;
    for(i = 0;i < numsSize;i++){
        if(nums[i] != val){
            nums[k++] = nums[i];
        }
    }
    
    return k;
}

遍历数组，当前元素值等于val时，将其与数组最后元素交换，并移除最后元素。当前元素值不等于val时，直接对下一个元素遍历


int removeElement(int* nums, int numsSize, int val){
    
    int i = 0;
    while(i < numsSize){
    
        if(nums[i] == val){
            int temp = nums[i];
            nums[i] = nums[numsSize-1];
            nums[numsSize-1] = nums[i];
            numsSize--;//移除最后元素
        }
        else{
            i++;
        }
    }
    
    return numsSize;
}