Comments

• 
  

  0

  

  scu09156146  commented on May 7, 2024, 5:49 p.m. ← edit 4 →

  題解

  import java.util.Arrays;
  import java.util.Scanner;
  
  class Handle {
      int ReturnMax(int[] a) {
          int max = a[0];
          for (int i = 1; i < a.length; i++) {
              max = Math.max(max, a[i]); // 依序找最大值
          }
          return max;
      }
  
      int ReturnMin(int[] a) {
          int min = a[0];
          for (int i = 1; i < a.length; i++) {
              min = Math.min(min, a[i]); // 依序找最小值
          }
          return min;
      }
  
      String Reverse(int[] a) {
          String s = ""; // 將要回傳的反轉陣列，用字串記錄
          for (int i = a.length - 1; i >= 0; i--)
              s += a[i] + " "; // 反向存到s
          return s;
      }
  
  }
  
  public class ListHandle {
  
      public static void main(String[] args) {
          // TODO Auto-generated method stub
          Scanner input = new Scanner(System.in);
          int n = input.nextInt();
          int[] a = new int[n];
          for (int i = 0; i < n; i++) {
              a[i] = input.nextInt();
          }
          input.close();
  
          Handle h = new Handle(); // 建立Handle物件，傳入陣列
          System.out.print(h.ReturnMax(a) + " " + h.ReturnMin(a));
          System.out.print(" " + h.Reverse(a));
      }
  
  }