leetcode 26
简单,看看就好啦
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int length=nums.size();
if(length==0)
{
return 0;
}
int start=0;
for(int i=0;i<length;i++)
{
if(nums[start]==nums[i])
{
}
else if(nums[start]!=nums[i])
{
start++;
nums[start]=nums[i];
}
}
return start+1;
}
};
leetcode 27
与26同理
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int length=nums.size();
if(length==0)
{
return 0;
}
int start=0;
for(int i=0;i<length;i++)
{
if(nums[i]!=val)
{
nums[start++]=nums[i];
}
}
return start;
}
};
find函数直接调用