java经典算法题

最新推荐文章于 2024-09-14 18:46:05 发布

墨蓮～

最新推荐文章于 2024-09-14 18:46:05 发布

阅读量113

点赞数

文章标签： java 算法 jvm Powered by 金山文档

本文链接：https://blog.csdn.net/weixin_54040152/article/details/129545401

版权

//快排，重写Array.sort   

public static void main(String[] args) {
    Integer[] arr={45,23,54,5,545,454,54646,4515,1512,13};
    Arrays.sort(arr, new Comparator<Integer>() {
@Override
        public int compare(Integer o1, Integer o2) {
return o2 - o1;     //返回值调换值位置可改变排序降序
        }
    });
    for (int i = 0; i < arr.length; i++) {
        System.out.print(arr[i]+" ");
    }
}

//    不死神兔
    public static void main(String[] args) {
//解法一
        int[] arr=new int[12];
        arr[0]=1;
        arr[1]=1;
        for (int i = 2; i < arr.length; i++) {
            arr[i]=arr[i-1]+arr[i-2];
        }
        System.out.println(arr[11]);
        

        //解法二
        int getnumber = getnumber(12);
        System.out.println(getnumber);
    }

    private static int getnumber(int i) {
        if(i==1||i==2){
            return 1;
        }else {
            return getnumber(i-1)+getnumber(i-2);
        }
    }

//    猴子吃桃
    public static void main(String[] args) {
        int i = getnumber2(1);
        System.out.println(i);
    }

    private static int getnumber2(int day) {
        if(day<=0||day>=11)return -1;
        if(day==10){
            return 1;
        }
        return (getnumber2(day+1)+1)*2;
    }

    public static void main(String[] args) {
        int i = getnumber3(20);
        System.out.println(i);
    }

    private static int getnumber3(int i) {
        if(i==1) return 1;
        if(i==2) return 2;
        return getnumber3(i-1)+getnumber3(i-2);
    }