-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathremove-element.py
executable file
·41 lines (35 loc) · 1 KB
/
remove-element.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
# -*- coding:utf-8 -*-
# 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.
#
#
# Try two pointers.
# Did you use the property of "the order of elements can be changed"?
# What happens when the elements to remove are rare?
class Solution(object):
def removeElement(self, nums, val):
"""
:type nums: List[int]
:type val: int
:rtype: int
"""
i = 0
l = len(nums)
while i < l:
if nums[i] == val:
del nums[i]
l = l-1
else:
i = i+1
return len(nums)