《Java语言程序设计与数据结构》编程练习答案（第十九章）（二）

《Java语言程序设计与数据结构》编程练习答案（第十九章）（二）

英文名：Introduction to Java Programming and Data Structures, Comprehensive Version, 11th Edition

19.7

public class book {


    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        Integer[] test = {1,1,4,5,8,9,10};
        System.out.println(binarySearch(test, 9));
        System.out.println(binarySearch(test, 114));

    }

    public static <T extends Comparable<T>> int binarySearch(T[] list, T key){
        return search(list, key, 0, list.length-1);
    }

    public static <T extends Comparable<T>> int search(T[] list, T key, int low, int high){
        if(high == low + 1){
            if(key.compareTo(list[low]) == 0){
                return low;
            }
            else if(key.compareTo(list[high]) == 0){
                return high;
            }
            else{
                return -1;
            }
        }
        int mid = (low + high) / 2;
        if(key.compareTo(list[mid]) == 0){
            return mid;
        }else if(key.compareTo(list[mid]) < 0){
            return search(list, key, low, mid);
        }else{
            return search(list, key, mid, high);
        }
    }
}

19.8

public class book {


    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        ArrayList<Integer> test = new ArrayList<>();
        for(int i=0;i<10;i++){
            test.add(i);
        }
        shuffle(test);
        for(int i=0;i<10;i++){
            System.out.print(test.get(i)+" ");
        }
    }

    public static <T> void shuffle(ArrayList<T> list){
        int len = list.size();
        for(int i=0;i<len;i++){
            T tmp = list.remove((int)((len-i)*Math.random()));
            list.add(tmp);
        }
    }
}

19.9

public class book {


    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        ArrayList<Integer> test = new ArrayList<>();
        for(int i=0;i<10;i++){
            test.add(10-i);
        }

        sort(test);
        for(int i=0;i<10;i++){
            System.out.print(test.get(i)+" ");
        }

    }

    public static <T extends Comparable<T>> void sort(ArrayList<T> list){
        for(int i=list.size()-1;i>0;i--){
            for(int j=0;j<i;j++){
                if(list.get(j).compareTo(list.get(j+1)) > 0){
                    T tmp = list.get(j);
                    list.remove(j);
                    list.add(j+1,tmp);
                }
            }
        }
    }
}

19.10

public class book {


    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        ArrayList<Integer> test = new ArrayList<>();
        test.add(114);
        test.add(514);
        test.add(1919);
        test.add(810);
        System.out.println(max(test));
    }

    public static <T extends Comparable<T>> T max(ArrayList<T> list){
        T ret = list.get(0);
        for (T t : list) {
            if (ret.compareTo(t) < 0) {
                ret = t;
            }
        }
        return ret;
    }
}

19.11

🐎

第十九章 完