class Solution {
public int removeElement(int[] nums, int val) {
int slow = 0;
int fast = 0;
while (fast <= nums.length -1){
if (nums[fast] != val){
nums[slow++] = nums[fast];
}
fast++;
}
return slow;
}
}
class Solution {
public int search(int[] nums, int target) {
int left = 0 ;
int right = nums.length-1;
int mid;
if (target > nums[nums.length-1] || target < nums[0]) return -1;
while(left <= right){ //必须是小于等于,不然单独查找只含有一个数字的数组会查不到而返回-1
//mid = left + ( right - left ) / 2 ;
mid = left + (( right - left ) >> 1) ;//后边要加括号
if(nums[mid] == target) return mid;
else if (nums[mid] > target) {
right = mid-1;
}
else if (nums[mid] < target){
left = mid+1;
}
}
return -1;
}
}