蓝桥杯- 基础练习:数列排序

 

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int cNumber = scanner.nextInt();
        List<Integer> list = new ArrayList<Integer>();
        for (int i = 0; i < cNumber; i++) {
            list.add(scanner.nextInt());
        }
        Collections.sort(list);
        String replace = list.toString().replaceAll("[\\[\\],]","");
        System.out.println(replace);
    }
}
import java.util.Arrays;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        //数组排序
        Scanner scanner = new Scanner(System.in);
        int cNumber = scanner.nextInt();
        int nums[] = new int[cNumber];
        for (int i = 0; i < cNumber; i++) {
            nums[i]=scanner.nextInt();
        }
        Arrays.sort(nums);
        for (int i = 0; i < nums.length; i++) {
            System.out.print(nums[i]+" ");
        }
    }
    
}
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int cNumber = scanner.nextInt();
        List<Integer> list = new ArrayList<Integer>();
        for (int i = 0; i < cNumber; i++) {
            list.add(scanner.nextInt());
        }
        list.sort(new Comparator<Integer>() {
            @Override
            public int compare(Integer arg0, Integer arg1) {
                return Integer.compare(arg0, arg1);
            }
        });
        String replace = list.toString().replace("[", "");
        String replace2 = replace.replace("]", "");
        String replace3 = replace2.replace(",", "");
        System.out.println(replace3);
    }
}

 

转载于:https://www.cnblogs.com/wzqjy/p/8280579.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值