Java入门：短路求和，交换数字

最新推荐文章于 2024-09-18 11:04:20 发布

生平无冕°

最新推荐文章于 2024-09-18 11:04:20 发布

阅读量87

点赞数

分类专栏： Java 文章标签： leetcode

本文链接：https://blog.csdn.net/qq_40992386/article/details/108743674

版权

Java 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

import java.util.Arrays;

public class Rank {
    static int result;
    public static void main(String[] args) {
        System.out.println(sum(5));
        System.out.println("=.=.=.=.=.=.=.=.=.=.=.=");
        int[] arr = new int[]{2,3,4,1,5,7};//2,1,3,5,4,7
        int[] num = shffle(arr,arr.length/2);
        System.out.println(Arrays.toString(num));
        System.out.println("=.=.=.=.=.=.=.=.=.=.=.=");
        int[] ary = new int[]{2,3};//3,2
        System.out.println(swapNums(ary));
    }

    private static int sum(int n) {
        boolean flag = n > 1 && sum(n-1) > 0;
        result += n;
        return result ;//n+(n-1)+..+1
    }

    public static int[] shffle(int[] arr, int n){
        int[] ret = new int[arr.length];
        int a = 0;
        for (int i = 0; i < n; i++) {
            ret[a++] = arr[i];
            ret[a++] = arr[n+i];
        }
        return ret;
    }

    public static String swapNums(int[] num){
        num[0] ^= num[1];
        num[1] ^= num[0];
        num[0] ^= num[1];
        return Arrays.toString(num);
    }
}