二分查找（leetCode)

二分查找（leetCode)

```java
package com.leetcode.array;

import javax.xml.stream.events.StartDocument;

/**
 *给定一个 n 个元素有序的（升序）整型数组 nums 和一个目标值 target  ，
 * 写一个函数搜索 nums 中的 target，
 * 如果目标值存在返回下标，否则返回 -1
 * 输入: nums = [-1,0,3,5,9,12], target = 9
 * 输出: 4
 * 解释: 9 出现在 nums 中并且下标为 4
 */
public class BinResearch {
    public static void main(String[] args) {
        int[] nums = {-1,0,3,5,9,12};
        BinaryResearch binaryResearch = new BinaryResearch();
        int index = binaryResearch.findNumber(nums, 1);
        System.out.println(index);
    }
}

class BinaryResearch{
    public static int findNumber(int[] nums, int target){
        int left = 0;
        int right = nums.length - 1;

        if(nums[0] > target || nums[nums.length-1] < target) return -1;
        while (left <= right){
            int middle = (left + right)/2;
            if(nums[middle]>target){
                right = middle - 1;
            }
            else if(nums[middle] < target){
                left = middle + 1;
            }
            else return middle;

        }
        return -1;
    }
}