-
Notifications
You must be signed in to change notification settings - Fork 25
Expand file tree
/
Copy path27_RemoveElement.py
More file actions
43 lines (31 loc) · 1.06 KB
/
27_RemoveElement.py
File metadata and controls
43 lines (31 loc) · 1.06 KB
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
42
43
# coding: utf8
"""
题目链接: https://leetcode.com/problems/remove-element/description.
题目描述:
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 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:
Given nums = [3,2,2,3], val = 3,
Your function should return length = 2, with the first two elements of nums being 2.
"""
class Solution(object):
def removeElement(self, nums, val):
"""
:type nums: List[int]
:type val: int
:rtype: int
"""
if not nums:
return 0
total = len(nums)
counter = 0
cursor = 0
for i in range(0, total):
if val == nums[i]:
counter += 1
else:
nums[cursor] = nums[i]
cursor += 1
return total - counter