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.

思路

上一题是有序数组，这题是无序数组，这里根据python的引用机制可以有一些trick，但是还是选择用双指针老老实实做，将数组划分，发现了需要剔除的数之后，交换位置即可，这样做的话，最后左指针的位置就是长度，其后的都是重复的字符

code

class Solution:
    def removeElement(self, nums, val):
		i, j = 0, len(nums)-1
		while i <= j:
			if nums[i] == val:
				nums[i], nums[j] = nums[j], nums[i]
				j -= 1
			else:
				i += 1
		return i