class Solution {
public int search(int[] nums, int target) {
int left = 0, right = nums.length - 1;
while (left <= right){
int mid = (left + right)/2;
if(nums[mid] == target) {
return mid;
} else if (nums[mid] > target) {
right = mid - 1;
} else if (nums[mid] < target) {
left = mid + 1;
}
}
return -1;
}
}
class Solution {
public int removeElement(int[] nums, int val) {
int head = 0, tail = 0;
int num;
while(tail <= nums.length - 1){
if (nums[tail] != val){
num = nums[head];
nums[head] = nums[tail];
nums[tail] = num;
head++;
}
tail++;
}
return head;
}
}