算法强化每日一题--排序子序列

public class Main {
    public static void main(String[] args) {
        //先处理输入
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] array = new int[n + 1];
        for (int i = 0; i < n; i++) {
            array[i] = scanner.nextInt();
        }
        //定义下标
        int i = 0;
        int count = 0;
        //分三种情况
        while (i < n) {
            if (array[i] < array[i + 1]) {
                while (i < n && array[i] < array[i + 1]) {
                    i++;
                }
                count++;
                i++;
            } else if (i < n && array[i] == array[i + 1]) {
                i++;
            } else {
                while (i < n && array[i] > array[i + 1]) {
                    i++;
                }
                count++;
                i++;
            }
            System.out.println(count);
        }
    }
}