class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int len = nums.size();
if(len<2) return len;
int s = 0, f = 1;
while(f<len){
if(nums[s]!=nums[f]){
nums[++s] = nums[f];
}
f++;
}
return s+1;
}
};
LeetCode - 26. Remove Duplicates from Sorted Array
猜你喜欢
转载自blog.csdn.net/real_lisa/article/details/90166083
今日推荐
周排行