Day02_Recursion&QuickSort&Arrays&Date&SimpleDateFormat&LocalDateTime&Period&Duration

递归

//利用递归求1-100的和
  int sum = getSum(100);
        System.out.println(sum);
    }
    //如果不给递归设置出口的话 会出现下面的错误
    //StackOverflowError 栈内存溢出错误
    public static int getSum(int i){
   
        if (i==1){
   
            return 1;
        }else{
   
            return i+getSum(i-1);
        }
    }

 //利用递归求5的阶乘(5*4*3*2*1)
       int result= getSum(5);
        System.out.println(result);
    }

    public static int getSum(int i) {
   
        if(i==1){
   
            return 1;
        }else{
   
            return i*getSum(i-1);
        }
    }

//随堂联系:计算斐波那契数列的第n项 假设n从0开始算3
//0 1 1 2 3 5 8 13 21 34...

    public static void main(String[] args) {
   
       int result= getCount(8);
        System.out.println(result);//34
    }

    public static int getCount(int n) {
   
        if (n==0||n==1){
   
            return 1;
        }else{
   
            return  getCount(n-1)+getCount(n-2);
        }

    }

利用递归快速排序

    
    public static void main(String[] args) {
   
        
        int []arr = {
   6,3,5,8,9,1,2,4,10,7};
        quickSort(arr,0,arr.length-1);
        for (int i = 0; i < arr.length; i++) {
   
            System.out.println(arr[i]);
        }

    }

    private static void quickSort(int[] arr, int left, int right) {
   
        if(left>right){
   
            return;
        }
         int left0 =left;
         int right0=right;
         int v=arr[left0];//基准点
        //基本条件 基准点左边的始终比右边的小(不相等)
        while(left<right){
   

            while(arr[right]>=v&&left<right){
   
                 right--;
            }
            while(arr[left]<=v&&left<right){
   
                left++;
            }
            swap(arr<