首页 > 试题广场 >

Simple Sorting

[编程题]Simple Sorting

热度指数：5229 时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 64M，其他语言128M
算法知识视频讲解

You are given an unsorted array of integer numbers. Your task is to sort this array and kill possible duplicated elements occurring in it.

输入描述:

For each case, the first line of the input contains an integer number N representing the quantity of numbers in this array(1≤N≤1000). Next N lines contain N integer numbers(one number per each line) of the original array.

输出描述:

For each case ,outtput file should contain at most N numbers sorted in ascending order. Every number in the output file should occur only once.

示例1

输入

6
8 8 7 3 7 7

输出

3 7 8

算法知识视频讲解

Java

可乐朗姆

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Stream;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()) {
			int n = sc.nextInt();
			List<Integer> list = new ArrayList<>();
			for(int i=0;i<n;++i) {
				list.add(sc.nextInt());
			}
			Stream stream = list.stream();
			stream.distinct().sorted().forEach(i->System.out.print(i+" "));
		}
	}
}

发表于 2023-03-05 14:49:00 回复(0)

Java

LHC0512

Java 解法，使用TreeSet

import java.util.Scanner;
import java.util.TreeSet;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        TreeSet<Integer> set = new TreeSet<>();
        for (int i = 0; i < n; i++) set.add(scanner.nextInt());
        for (Integer integer : set) System.out.print(integer+" ");
    }
}

发表于 2020-03-14 11:17:39 回复(0)