LeetCode算法题之27. Remove Element（easy）

题目描述：
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 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.

解题思路：

• 如题所述，给定一个数组，给定一个数值，将数组中与给定数值相同的元素移除，返回不重复元素的长度
• 因题目不难，个人是设置了一个变量n，用来指示需要变换元素（也就是与给定值不相等的）的索引，相等的自然什么也不做，直接向下遍历即可
• 见代码，一目了然

少废话，上代码：

class Solution:
    def removeElement(self, nums, val):
        n = 0#设置变量n，用来指定需要变换元素的位置

        for i in range(len(nums)):
            if nums[i] != val:#当不相等的时候，直接原地替换掉
                nums[n] = nums[i]
                n += 1#指向下一个位置

        return n

时间空间复杂度：

• Runtime: 28 ms, faster than 84.90% of Python3 online submissions for Remove Element.
• Memory Usage: 13.8 MB, less than 6.06% of Python3 online submissions for Remove Element.