classSolution{publicintfindMin(int[] nums){int left =0;int right = nums.length-1;while(left<right){int mid = left +(right - left)/2+1;if(nums[mid]>= nums[0]){
left = mid;}else{
right = mid-1;}}if(right == nums.length-1)return nums[0];return nums[right+1];}}
3- ACM 实现
publicclass findMin {publicstaticintbinaryS(int[] nums){int left=0;int right = nums.length-1;while(left<right){int mid =(left+right)/2+1;if(nums[mid]>= nums[0]){
left = mid;}else{
right = mid-1;}}if(right == nums.length-1)return nums[0];return nums[right+1];}publicstaticvoidmain(String[] args){Scanner sc =newScanner(System.in);String input = sc.nextLine();
input = input.replace("[","").replace("]","");String[] parts = input.split(",");int[] nums =newint[parts.length];for(int i =0; i < nums.length; i++){
nums[i]=Integer.parseInt(parts[i]);}System.out.println("结果是"+binaryS(nums));}}