二分查找

最新推荐文章于 2024-09-18 23:47:54 发布

lyhellogod

最新推荐文章于 2024-09-18 23:47:54 发布

阅读量74

点赞数

分类专栏： leetcode 文章标签：二分法

本文链接：https://blog.csdn.net/lyhellogod/article/details/114731012

版权

leetcode 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

/**
 * TODO
 *  二分查找例子
 * @author Roy
 * @date 2021/2/10 23:10
 */
public class BinarySearch {
    public static void main(String[] args) {
        int a[] = new int[]{0,1,2,6,7,12,15,78};
        int result = binarySearch(a,7);
        System.out.println(result);
    }
    public static int binarySearch(int search[],int target){
        int left =0;
        int right=search.length-1;
        int middle = 0;
        int result = 0;
        while (left<right){
            middle = (left+right)/2;
            if(target==search[middle]) return middle;
            else if(target<search[middle]) right = middle;
            else left = middle+1;
        }
        return -1;
    }
}