绝对值排序---抽象JAVA

解题思路:

TreeSet去重，排序

Comparator 绝对值排序

注意事项:无

参考代码:

import java.util.*;

public class Main {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

TreeSet<Integer>treeSet=new TreeSet<>();

while(true) {

int n=sc.nextInt();

if(n==0) {

System.out.println(" ");

break;

}else {

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

int a=sc.nextInt();

treeSet.add(a);

}

Integer[]arr=new Integer[treeSet.size()];

int count=0;

for(int i:treeSet) {

arr[count]=i;

count++;

}

treeSet.clear();

Arrays.sort(arr,Comparator.comparingInt(Math::abs));

for(int j=arr.length-1;j>=0;j--) {

    System.out.print(arr[j]+" ");

}

System.out.println(" ");

}

}

}

}