27_RemoveElement - a920604a/leetcode GitHub Wiki
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int slow = 0, fast = 0, n = nums.size();
while(fast<n){
if(nums[fast] !=val ) nums[slow++] = nums[fast];
fast++;
}
return slow;
}
};
- time complexity
O(n)
- space complexity
O(1)