Java蓝桥杯--基础练习 （1）数列排序

题目：

 

解决方案：

 1 import java.util.Scanner;
 2 
 3 public class Main {
 4     public static void main(String[] args) {
 5         Scanner read = new Scanner(System.in);
 6         int n = read.nextInt();
 7         long F[] = new long[n + 3];
 8         for (int i = 0; i <= n-1; i++) {
 9             F[i] = read.nextInt();
10         }
11         for (int i = 0; i < n-1; i++) {
12             for(int j=i+1;j<n;j++){
13                 if (F[i] > F[j]) {
14                 long m = F[i];F[i] = F[j];F[j] = m;
15             } 
16             }
17         }
18         for (int i = 0; i <= n-1; i++) {
19            System.out.print(F[i]);
20             System.out.print(" ");
21         }
22     }
23 }

 

转载于:https://www.cnblogs.com/Catherinezhilin/p/8482715.html