moonlightshadow123
4/10/2017 - 2:46 PM

27-Remove-Element <----> leetcode-3

27-Remove-Element <----> leetcode-3

two_pointer.py
content_copyfile_download
class Solution(object):
    def removeElement(self, nums, val):
        """
        :type nums: List[int]
        :type val: int
        :rtype: int
        """
        self.slow = 0
        for fast in range(len(nums)):
            # For each element in nums
            if nums[fast] != val:
                # If fast != val, add fast to slow, and increase slow.
                nums[self.slow] = nums[fast]
                self.slow += 1
        return self.slow
27-Remove-Element.md
content_copyfile_download
  • Rendered
  • Source

https://leetcode.com/problems/remove-element/

Given an array and a value, 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 in place with constant memory.

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

Example: Given input array nums = [3,2,2,3], val = 3

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