-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathremoveElement.cpp
More file actions
50 lines (48 loc) · 1.28 KB
/
removeElement.cpp
File metadata and controls
50 lines (48 loc) · 1.28 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
/*
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.
*/
//my Solution
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int len=nums.size();
int i=0,j=len-1,cnt=0;
while(i<=j)
{
if(nums[i]==val)
{
if(nums[j]==val)
{
j--;
}else
{
swap(nums[i],nums[j]);
i++;
j--;
}
cnt++;
}else{
i++;
}
}
nums.resize(len-cnt);
return len-cnt;
}
};
//better Solution
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int len=nums.size();
int begin=0;
for(int i=0;i!=len;i++)
if(nums[i]!=val)
nums[begin++]=nums[i];
return begin;
}
};