题目:

题解:
int removeDuplicates(int* nums, int numsSize) {
if (numsSize == 0) {
return 0;
}
int fast = 1, slow = 1;
while (fast < numsSize) {
if (nums[fast] != nums[fast - 1]) {
nums[slow] = nums[fast];
++slow;
}
++fast;
}
return slow;
}















![[大模型]Baichuan2-7B-chat FastApi 部署调用](https://img-blog.csdnimg.cn/direct/9f56da2b1ce14aaaa1f1b15018e6682b.png)



