class Solution {
public:
int removeElement(vector<int>& nums, int val) {
size_t size = nums.size();
if(size == 0)
return 0;
int i = 0;
int j = 0;
int count = 0;
while(i < size)
{
while (j < size && nums[j] != val)
j++;
i = j;
while (i < size && nums[i] == val)
i++;
if(i - j == size)
return 0;
if(i < size)
swap(nums[i], nums[j]);
}
for(i = 0; i < size; ++i)
{
if(nums[i] != val)
count++;
}
return count;
}
};
class Solution {
public:
int searchInsert(vector<int>& nums, int target) {
int L = 0;
int R = nums.size() - 1;
int middle = 0;
if (target < nums[0])
return 0;
if (target > nums[nums.size() - 1])
return nums.size();
while (L <= R)
{
middle = L + ((R - L) >> 1) ;
if (nums[middle] < target)
L = middle + 1;
else if (nums[middle] > target)
R = middle - 1;
else
return middle;
}
return L;
}
};