18 lines
385 B
C++
18 lines
385 B
C++
|
#include "s0026_remove_duplicates_from_sorted_array.hpp"
|
||
|
|
||
|
int Solution::removeDuplicates(vector<int>& nums) {
|
||
|
int size = nums.size();
|
||
|
if (size == 0 || size == 1) {
|
||
|
return size;
|
||
|
}
|
||
|
int slow{0};
|
||
|
for (int fast{1}; fast < size; ++fast) {
|
||
|
if (nums.at(fast) == nums.at(slow)) {
|
||
|
continue;
|
||
|
} else {
|
||
|
nums[++slow] = nums.at(fast);
|
||
|
}
|
||
|
}
|
||
|
return slow + 1;
|
||
|
}
|