import java.util.List; import java.util.ArrayList; import java.util.Arrays; public class Program{ public static void main(String[] args){ //c#里可以这样啊:List<int> list = new List<int>() { 2, 3, 5, 8, 7 }; //目前JAVA还不行啊 Integer a[]={2,3,5,8,7}; List<Integer> list=Arrays.asList(a); int result = SequenceSearch(list, 3); if (result != -1) System.out.println("3 已经在数组中找到,索引位置为:" + result); else System.out.println("呜呜,没有找到!"); } //顺序查找 public static int SequenceSearch(List<Integer> list, int key){ for (int i = 0; i < list.size(); i++) { //查找成功,返回序列号 if (key == list.get(i)) return i; } //未能查找,返回-1 return -1; } }
import java.util.*; public class BSearch{ public static void main(String[] args) { Integer a[]={ 3, 7, 9, 10, 11, 24, 45, 66, 77 }; List<Integer> list=Arrays.asList(a); int result = BinarySearch(list, 45); if (result != -1) System.out.println("45 已经在数组中找到,索引位置为:" + result); else System.out.println("呜呜,没有找到!"); } // 折半查找 public static int BinarySearch(List<Integer> list, int key) { //最低线 int low = 0; //最高线 int high = list.size() - 1; while (low <= high) { //取中间值 int middle = (low + high) / 2; if (list.get(middle) == key){ return middle; } else if (list.get(middle) > key){ //下降一半 high = middle - 1; }else{ //上升一半 low = middle + 1; } } //未找到 return -1; } }
0票
开心
0票
板砖
0票
感动
0票
有用
0票
疑问
0票
难过
0票
无聊
0票
震惊
顶
踩