蓝桥杯摆动序列Java
时间: 2023-05-31 08:04:35 浏览: 68
代码如下:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] nums = new int[n];
for (int i = 0; i < n; i++) {
nums[i] = scanner.nextInt();
}
int count = 1;
int maxCount = 1;
boolean isUp = false;
for (int i = 1; i < n; i++) {
if (nums[i] > nums[i - 1]) {
if (!isUp) {
count = 1;
}
count++;
isUp = true;
} else if (nums[i] < nums[i - 1]) {
if (isUp) {
count = 1;
}
count++;
isUp = false;
}
maxCount = Math.max(maxCount, count);
}
System.out.println(maxCount);
}
}