线性查找算法

线性查找高复用：

public class Test {

    public static void main(String[] args) {
        //线性查找
        int a[] ={1,2,3};
        Integer w[] ={3,5,6,8};
        Test t=new Test();
        int res= t.LineSearch(w,8);
        /*
        int result=-1;
        Scanner sc=new Scanner(System.in);
        int b=sc.nextInt();
        System.out.print("您输入的是:"+b);
        for (int i=0;i<a.length;i++){
            if (a[i]==b){
                result=i;
            }
        }
        System.out.print("您输入的数字所在的位置是:"+result);*/
        System.out.print(res);


    }
    private Test(){}
    public  static <E> int LineSearch(E[] a,E target){
        for (int i=0;i<a.length;i++)
            if (a[i].equals(target))
                return i;
        return -1;

    }



}