mirror of
https://github.com/Manoj-HV30/dsa-competitive-programming.git
synced 2026-05-16 19:35:22 +00:00
15 lines
361 B
C++
15 lines
361 B
C++
class Solution{
|
|
public:
|
|
int removeELement(vector<int>& nums, int val){
|
|
int k = 0;
|
|
for(int i = 0;i<nums.size();i++){
|
|
if(nums[i]!=val)
|
|
nums[k++] = nums[i];
|
|
|
|
}
|
|
return k;
|
|
}
|
|
};
|
|
// i-> scans every element
|
|
// k-> stores only valid(!=val) elements
|