if(nums.empty())
return 0 ;
int len = nums.size();
int a = 1 ;
for(int i=1;i<len;i++)
{
if(nums[i]!=nums[a-1])
{
nums[a++] = nums[i];
}
}
return a;
if(nums.empty())
return 0 ;
int len = nums.size();
int a = 1 ;
for(int i=1;i<len;i++)
{
if(nums[i]!=nums[a-1])
{
nums[a++] = nums[i];
}
}
return a;
转载于:https://www.cnblogs.com/tong-joker/p/6512600.html