摘要: 1、二分法 int[] arr = {1,2,3,4,5,6,7,8,9,10}; int key = 2; int min ,max ,mid; min = 0; max = arr.length-1; mid = (min+max)>>1;//(min+max)/2 while (arr[mid 阅读全文
posted @ 2017-02-06 09:43 zhi昕 阅读(133) 评论(0) 推荐(0) 编辑