Cacher is the code snippet organizer for pro developers

import java.util.*;

public class Main {

	public static void main(String[] args) {
		Scanner scn = new Scanner(System.in);
		int n = scn.nextInt();
		while (n-- != 0) {
			String str = scn.next(), s[] = str.split(",");//字串切割
			int arr[] = new int[s.length], ary[] = new int[s.length], a = 0, b = 0;//建立兩個等長陣列比對用
			for (int i = 0; i < s.length; i++) {
				arr[i] = Integer.parseInt(s[i]);//存入要排序的陣列
				ary[i] = Integer.parseInt(s[i]);//存入做原始比對的陣列
			}
			Arrays.sort(arr);//排序
			for (int i = 0, j = arr.length - 1; i < arr.length; i++, j--) {
				if (arr[i] == ary[i])//a紀錄遞增相同數量
					a++;
				if (arr[i] == ary[j])//b紀錄遞減相同數量
					b++;
			}
			if (a == arr.length)//a等於長度時代表是遞增數列
				System.out.println("ASC");
			else if (b == arr.length)//b等於長度時代表是遞減數列
				System.out.println("DESC");
			else
				System.out.println("NOON");
		}
	}
}