题解 1169: 绝对值排序

来看看其他人写的题解吧!要先自己动手做才会有提高哦! 
返回题目 | 我来写题解

筛选

绝对值排序---抽象JAVA

解题思路:TreeSet去重,排序Comparator绝对值排序注意事项:无参考代码:importjava.util.*;publicclassMain{publicstaticvoidmain(String[]args){Scannersc=newScanner(System.in);TreeSet

简单易懂的方法

```javaimportjava.util.Scanner;publicclass测试{publicstaticvoidmain(String[]args){Scannersr=newScanner(System.in);intn;while(true){n=sr.nextInt();int[]a=

List直接比较器

摘要:import java.util.*;public class Main {    static Scanner in=new Scanner(System.in);    public static……

好像一遍过(用了List)

```javaimportjava.util.*;publicclassMain{publicstaticvoidmain(String[]args){Scannersc=newScanner(System.in);while(sc.hasNext()){intn=sc.nextInt();if(n=

编写题解 1169: 绝对值排序

```javaimportjava.util.Arrays;importjava.util.Comparator;importjava.util.Scanner;publicclass测试{publicstaticvoidmain(String[]args){Scannerscanner=newSca

1169: 绝对值排序(java)

importjava.util.*;publicclassMain{publicstaticvoidmain(String[]args){Scannerscanner=newScanner(System.in);while(scanner.hasNext()){intn=scanner.nextInt

绝对值排序-题解(Java代码)

publicstaticvoidmain(String[]args){Scannerscanner=newScanner(System.in);while(scanner.hasNext()){intn=scanner.nextInt();if(n==0){break;}else{longa[]=ne