forked from yanglei-github/Leetcode_in_python3
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path27_Remove Element.py
More file actions
51 lines (45 loc) · 1.25 KB
/
27_Remove Element.py
File metadata and controls
51 lines (45 loc) · 1.25 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
44
45
46
47
48
49
50
51
# -*- coding: utf-8 -*-
"""
Created on Wed Aug 28 09:16:20 2019
@author: leiya
"""
class Solution:
def removeElement(self, nums: List[int], val: int) -> int:
i = 0
while i <= len(nums)-1:
if nums[i] == val:
nums.pop(i)
else:
i += 1
return len(nums)
class Solution:
def removeElement(self, nums: List[int], val: int) -> int:
#two pointers from start and end
if not nums:
return 0
pre = 0
post = len(nums) - 1
while pre < post:
if nums[pre] == val:
if nums[post] == val:
post -= 1
else:
nums[pre],nums[post] = nums[post],nums[pre]
pre += 1
else:
pre += 1
if nums[pre] == val:
return pre
else:
return pre + 1
class Solution:
def removeElement(self, nums: List[int], val: int) -> int:
pre = 0
post = len(nums) - 1
while pre <= post:
if nums[pre] == val:
nums[pre],nums[post] = nums[post],nums[pre]
post -= 1
else:
pre += 1
return post + 1