Discuss / Java / 先整成升序排列,再两边交换数值化为降序

先整成升序排列,再两边交换数值化为降序

Topic source

何梓猪

#1 Created at ... [Delete] [Delete and Lock User]

        // TODO:

        Arrays.sort(ns);

        int j = 1;

        for (int i = 0; i<j ; i++){

            j = ns.length-1-i;

            int tem = ns[i];

                ns[i] = ns[j];

                ns[j] = tem;

        }


  • 1

Reply