JAVA hdu 2004(成绩转换)&&hdu 2020(绝对值排序)

2004、没有遇到什么问题。

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        int a;
        Scanner inScanner = new Scanner(System.in);
        while (inScanner.hasNextInt()) {
            a = inScanner.nextInt();
            if (a >= 90 && a <= 100)
                System.out.println("A");
            else if (a < 90 && a >= 80)
                System.out.println("B");
            else if (a < 80 && a >= 70)
                System.out.println("C");
            else if (a < 70 && a >= 60)
                System.out.println("D");
            else if (a < 60 && a >= 0)
                System.out.println("E");
            else
                System.out.println("Score is error!");
        }
    }
}

2020、想找一下像qsort排序那样的方法，手动写一下排序的规则，然后直接调用方法进行排序。但是没有找到这样的方法，最后手写了一个冒泡排序。

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		int[] a = new int[105];
		int n;
		Scanner inScanner = new Scanner(System.in);
		while (inScanner.hasNextInt()) {
			n = inScanner.nextInt();
			if (n == 0)
				break;
			for (int i = 0; i < n; i++)
				a[i] = inScanner.nextInt();
			for (int i = n - 1; i >= 0; i--) {
				for (int j = 0; j < i; j++) {
					int temp;
					if (Math.abs(a[j]) < Math.abs(a[j + 1])) {
						temp = a[j];
						a[j] = a[j + 1];
						a[j + 1] = temp;
					}
				}
			}
			for (int i = 0; i < n - 1; i++)
				System.out.print(a[i] + " ");
			System.out.println(a[n - 1]);
		}
	}
}