实现线性查找法（数据结构)

Java基础薄弱，需要恶补。
IntelliJ IDEA Community Edition 2021.3.2编译
1、
public class LinearSearch {
    public int search(int[] data, int target){

        for(int i = 0; i < data.length; i++)
             if (data[i] == target)
                 return i;

        return -1;
    }
    public static void main (String[] args) {
        int[] data = {24, 18, 12, 9, 16, 66, 32, 4};
        LinearSearch ls = new LinearSearch();

        int res = ls.search(data, 16);
        System.out.println(res);

        int res2=ls.search(data,666);
        System.out.println(res2);
    }
}

 

2、
 public class LinearSearch {
    public  static int search(int[] data, int target){

        for(int i = 0; i < data.length; i++)
             if (data[i] == target)
                 return i;

        return -1;
    }
    public static void main (String[] args) {
        int[] data = {24, 18, 12, 9, 16, 66, 32, 4};
        //LinearSearch ls = new LinearSearch();// static的成员函数方法，就不需要创建LinearSearch 的对象，可以直接调用

        int res = LinearSearch.search(data, 16);
        System.out.println(res);

        int res2=LinearSearch.search(data,666);
        System.out.println(res2);
    }
}

缺点：只能查找int类型的数据，不希望重复写search函数。