摘要: 二分搜索法Java代码: public static int search(int x,int arr[],int start,int end) { while (start <= end) { int mid = (start + end) / 2; if (x == arr[mid]) { re 阅读全文
posted @ 2021-09-20 23:01 李雯婕 阅读(185) 评论(0) 推荐(0)