qq_49247218的博客

var array = [1, 2, 3, 4, 5, 6]; function search(array, target) { let left = 0; let right = array.length - 1; let middle; while (left <= right) { // Math.floor向下取整 middle = Math.floor(left + (right - left) / 2); // 防止栈溢出 if (array[mi.