线性查找

import java.util.Scanner;

public class 第六次线性查找 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		System.out.println("输入数组长度：");
		int num = sc.nextInt();
		int a[] = new int[num];
		System.out.println("输入元素：(数字-666不能查询)");
		for (int i = 0; i < num; i++) {
			a[i] = sc.nextInt();
		}
		System.out.println("输入要查找的数：");
		int number = sc.nextInt();

		int k = linearSearch(a, number);
		if (k == -666)
			System.out.println("查无此数");
		else
			System.out.println("确有此数");
	}

	public static int linearSearch(int[] a, int key) {
		for (int i = 0; i < a.length; i++) {
			if (a[i] == key)
				return key;
		}
		return -666;
	}
}