class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int length=1;
if(nums.size()==0)
return 0;
else{
int temp = nums[0];
for(int i=1;i<nums.size();i++){
if(nums[i]<=temp){
for(int j=i;j<nums.size();j++){
if(nums[j]>temp){
nums[i]=nums[j];
temp=nums[j];
length = length + 1;
break;
}
}
}
else{
length = length + 1;
temp = nums[i];
}
}
}
return length;
}
};