摘要: 二分查找(search方法) public int search(int[] nums, int target) { int left=0; int right=nums.length-1; int mid; while(left<=right){ mid=(left+right)/2; if(nu 阅读全文
posted @ 2025-01-14 19:16 123木头人-10086 阅读(164) 评论(0) 推荐(0)