数据结构和算法-8.查找算法

1. 查找算法介绍

1. 顺序（线性）查找
2. 二分查找/折半查找
3. 插值查找
4. 斐波那契查找

2. 线性查找

public class SeqSearch {
    public static void main(String[] args) {
        int arr[] = {1, 9, 11, -1, 34, 89};
        int index = seqSearch(arr, 11);
        if (index == -1) {
            System.out.println("没有查找到");
        } else {
            System.out.println("找到了" + index);
        }
    }

    public static int seqSearch(int[] arr, int value) {
        //线性查找是逐一比对，发现有相同值，就返回下标
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] == value) {
                return i;
            }
        }
        return -1;
    }
}

3. 二分查找

查找单个值

public class BinarySearch {
    public static void main(String[] args) {
        int arr[] = {1, 8, 10, 89, 1000, 1234};
        int resIndex = binarySearch(arr, 0, arr.length - 1, 88);
        System.out.println(resIndex);
    }

    public static int binarySearch(int[] arr, int left, int right, int findVal) {
        int mid = (left + right) / 2;
        int midVal = arr[mid];

        if (left > right) {
            return -1;
        }
        if (findVal > midVal) {//向右递归
            return binarySearch(arr, mid + 1, right, findVal);
        } else if (findVal < midVal) {
            return binarySearch(arr, left, mid - 1, findVal);
        } else {
            return mid;
        }
    }
}

查找所有值

//二分查找的前提是该数组是有序的
public class BinarySearch {
    public static void main(String[] args) {
        int arr[] = {1, 8, 10, 89, 1000, 1000, 1000, 1234};
        ArrayList<Integer> list = binarySearch(arr, 0, arr.length - 1, 1000);
        System.out.println("位置是" + list);
    }

    public static ArrayList<Integer> binarySearch(int[] arr, int left, int right, int findVal) {
        int mid = (left + right) / 2;
        int midVal = arr[mid];

        if (left > right) {
            return new ArrayList<>();
        }
        if (findVal > midVal) {//向右递归
            return binarySearch(arr, mid + 1, right, findVal);
        } else if (findVal < midVal) {
            return binarySearch(arr, left, mid - 1, findVal);
        } else {
            ArrayList<Integer> resIndexList = new ArrayList<>();
            int temp = mid - 1;
            while (true) {
                if (temp < 0 || arr[temp] != findVal) {//退出
                    break;
                }
                resIndexList.add(temp);
                temp -= 1;//temp左移
            }
            resIndexList.add(mid);

            temp = mid + 1;
            while (true) {
                if (temp > arr.length - 1 || arr[temp] != findVal) {//退出
                    break;
                }
                resIndexList.add(temp);
                temp += 1;//temp右移
            }
            return resIndexList;
        }
    }
}

4. 插值查找

//插值查找算法也要求数组是有序的
public class InsertValueSearch {
    public static void main(String[] args) {
        int[] arr = new int[100];
        for (int i = 0; i < 100; i++) {
            arr[i] = i + 1;
        }
        //System.out.println(Arrays.toString(arr));
        System.out.println(insetValueSearch(arr, 0, arr.length - 1, 100));
    }

    public static int insetValueSearch(int[] arr, int left, int right, int findVal) {
        System.out.println("查找次数");
        if (left > right || findVal < arr[0] || findVal > arr[arr.length - 1]) {
            return -1;
        }
        //求出mid
        int mid = left + (right - left) * (findVal - arr[left]) / (arr[right] - arr[left]);
        int midVal = arr[mid];
        if (findVal > midVal) {//向右边递归查找
            return insetValueSearch(arr, mid + 1, right, findVal);
        } else if (findVal < midVal) {
            return insetValueSearch(arr, left, mid - 1, findVal);
        } else {
            return mid;
        }
    }
}

5. 斐波那契（黄金分割法）查找

public class FibonacciSearch {
    public static int maxSize = 20;

    public static void main(String[] args) {
        int[] arr = {1, 8, 10, 89, 1000, 1234};
        System.out.println(fibSearch(arr, 10));
    }

    //mid=low+F(k-1)-1需要用到斐波那契数列，这里需要先获取一个斐波那契数列
    //非递归方法得到一个斐波那契数列
    public static int[] fib() {
        int[] f = new int[maxSize];
        f[0] = 1;
        f[1] = 1;
        for (int i = 2; i < maxSize; i++) {
            f[i] = f[i - 1] + f[i - 2];
        }
        return f;
    }

    //斐波那契查找算法
    public static int fibSearch(int[] a, int key) {
        int low = 0;
        int high = a.length - 1;
        int k = 0;//表示斐波那契分割数值的下标
        int mid = 0;//存放mid值
        int f[] = fib();
        //获取到k
        while (high > f[k] - 1) {
            k++;
        }
        //因为f[k]值可能大于a的长度，因此需要使用Arrays类，构造一个新的数组，并指向a[]
        int[] temp = Arrays.copyOf(a, f[k]);
        //使用a数组最后的数填充temp
        for (int i = high + 1; i < temp.length; i++) {
            temp[i] = a[high];
        }
        //使用while来循环处理key
        while (low <= high) {
            mid = low + f[k - 1] - 1;
            if (key < temp[mid]) {//我们应该继续向数组的左边查找
                high = mid - 1;
                k--;
            } else if (key > temp[mid]) {//我们应该继续向数组的右边查找
                low = mid + 1;
                k -= 2;
            } else {//找到
                if (mid <= high) {
                    return mid;
                } else {
                    return high;
                }
            }
        }
        return -1;
    }
}