数组的线性查找
package com.hh.bean;
//数组的查找(算法:线性查找)
public class Seek {
public static void main(String[] args) {
//int 型数组的查找
int[] arr = new int[]{1,2,3,4,5,6};
boolean flag1 = true;
for(int i=0;i<arr.length;i++){
if(2==arr[i]){
System.out.println("找到了,在下标为"+i+"的位置");
flag1 = false;
break;
}
}
if(flag1){
System.out.println("未找到该元素!");
}
//字符串型数组的查找
String[] array = new String[]{"A","B","C","D","E","F"};
String seek = "D";
boolean flag2 = true;
for(int i=0;i<array.length;i++){
if(seek.equals(array[i])){
System.out.println("找到了,在下标为"+i+"的位置");
flag2 = false;
break;
}
}
if(flag2){
System.out.println("未找到该元素!");
}
}
}
下一节:数组的二分法查找