定义一个整数数组，判断是否是递增有序的，即数组中的每一个数，都不大于其后面的数...

 1 int arr[] = new int[5];
 2         System.out.println("请输入5个数");
 3         Scanner input = new Scanner(System.in);
 4 
 5         for (int i = 0; i < arr.length; i++) {
 6             arr[i] = input.nextInt();
 7         }
 8         int num = arr[0];
 9         int i = 0;
10         for (; i < arr.length; i++) {
11             if (num <= arr[i]) {
12                 num = arr[i];
13             } else {                
14                 break;
15             }
16         }
17         if (i >= arr.length) 
18             System.out.println("是递增数列");
19         else{
20             System.out.println("不是递增");
21         }
22         
23     }

 

public static void main(String[] args) {
        // 解法二
        int arr[] = new int[5];
        System.out.println("请输入5个数");
        Scanner input = new Scanner(System.in);
        for (int i = 0; i < arr.length; i++) {
            arr[i] = input.nextInt();
        }
        boolean flag = true;
        for (int i = 0; i < arr.length - 1; i++) {
            if (arr[i] > arr[i + 1]) {
                flag = false;
                break;
            }
        }
        if (flag == true)
            System.out.println("是递增数列");
        else {
            System.out.println("不是递增");
        }

    }

 

转载于:https://www.cnblogs.com/taoist123/p/10152285.html