-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path27-RemoveElement.py
More file actions
50 lines (46 loc) · 1.18 KB
/
27-RemoveElement.py
File metadata and controls
50 lines (46 loc) · 1.18 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
# Python3 双指针
from typing import List
class Solution:
def removeElement(self, nums: List[int], val: int) -> int:
fast = slow = 0
while fast < len(nums):
if nums[fast] != val:
nums[slow] = nums[fast]
slow += 1
fast += 1
return slow
# C
int removeElement(int* nums, int numsSize, int val) {
int fast = 0, slow = 0;
while (fast < numsSize) {
if (nums[fast] != val) {
nums[slow++] = nums[fast];
}
fast++;
}
return slow;
}
int removeElement(int* nums, int numsSize, int val) {
int slow = 0;
for (int fast = 0; fast < numsSize; fast++) {
if (nums[fast] != val) {
nums[slow] = nums[fast];
slow++;
}
}
return slow;
}
# C 双指针优化 题目中说「元素的顺序可以改变」
# 避免需要保留的元素的重复赋值操作
int removeElement(int* nums, int numsSize, int val) {
int left = 0, right = numsSize;
while (left < right) {
if (nums[left] == val) {
nums[left] = nums[right - 1];
right--;
} else {
left++;
}
}
return left;
}