class Solution {
    public int search(int[] nums, int target) {
        // 避免當 target 小于nums[0] nums[nums.length - 1]時多次循環(huán)運算
        if (target < nums[0] || target > nums[nums.length - 1]) {
            return -1;
        }
        int left = 0, right = nums.length - 1;
        while (left <= right) {
            int mid = left + ((right - left) >> 1);
            if (nums[mid] == target)
                return mid;
            else if (nums[mid] < target)
                left = mid + 1;
            else if (nums[mid] > target)
                right = mid - 1;
        }
        return -1;
    }
}

class Solution {
    public int removeElement(int[] nums, int val) {
        int size = nums.length;
        for (int i = 0; i < size;i++ ) {
            if (nums[i] == val) { // 發(fā)現(xiàn)需要移除的元素，就將數(shù)組后面集體向前移動一位
                for (int j = i + 1; j < size; j++) {
                    nums[j - 1] = nums[j];
                }
                i--; // 因為下標i以后的數(shù)值都向前移動了一位，所以i也向前移動一位
                size--;
            }
        }
        return size;
    }
}

class Solution {
    public int removeElement(int[] nums, int val) {
        int fast = 0;// 定義一個快指針遍歷數(shù)組
        int newLength = 0;// 定義新的數(shù)組長度
        while(fast < nums.length){
            if(nums[fast] != val){
                nums[newLength++] = nums[fast];
            }
            fast++;
        }
        return newLength;
    }
}