Leetcode【704】Binary Search（Java版）

这样的题最好一遍过，比较基础 

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