[LeetCode]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.

题目大意：给定一个数组nums和一个数值val，请删除在数组中的val，并将数组剩余长度返回。

样例

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 nums containing 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.

python解法

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        n = 0
        for i in range(len(nums)):
            if nums[i] != val:
                nums[n] = nums[i]
                n += 1
        return n

Runtime: 52 ms, faster than 12.08% of Python3 online submissions for Remove Element.
Memory Usage: 13.9 MB, less than 5.85% of Python3 online submissions for Remove Element.

题后反思：无

C语言解法

int removeElement(int* nums, int numsSize, int val){
    int n = 0;
    for(int i=0;i<numsSize;i++)
    {
        if(nums[i] != val)
        {
            nums[n++] = nums[i];
        }
    }
    return n;
}

Runtime: 4 ms, faster than 74.02% of C online submissions for Remove Element.
Memory Usage: 7.2 MB, less than 57.27% of C online submissions for Remove Element.

题后反思：无

文中都是我个人的理解，如有错误的地方欢迎下方评论告诉我，我及时更正，大家共同进步