int search(int* nums, int numsSize, int target){
int left=0;
int right=numsSize-1;
//取闭区间,所以left<=right
while(left<=right)
{
int mid=(left+right)/2;
if(nums[mid]>target)
right=mid-1;
else if(nums[mid]<target)
left=mid+1;
else return mid;
}
return -1;
}
int removeElement(int* nums, int numsSize, int val){
int slow=0,fast=0;
//快指针遍历数组,慢指针获取新数组,时间复杂度O(n)
for( fast=0; fast<numsSize; fast++ )
{
if(nums[fast]!=val) nums[slow++]=nums[fast];
}
return slow;
}