bnjsj

针对文中代码修改如下，见注释处 private static int search(int[] data,int l,int r,int target){ int mid; //注意：此处循环条件为data[mid]){ return searchDfs(data,mid+1,r,target); }else{ return searchDfs(data,l,mid,target); } }