【学习笔记】拦截导弹 JAVA

一个递归循环就解决了

import java.util.Scanner;


public class test_1 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
while(N-->0){
int m = sc.nextInt();
int[] num = new int[m];
for(int i = 0;i < m;i++){
num[i] = sc.nextInt();
}
count Count = new count();
Count.next(num, 0, 0, 0,true);
System.out.println(Count.max);
}
}
static class count{
int max = 0;
void next(int[] num,int loc,int height,int count,boolean start){
if(count>max){
max = count;
}
for(int i = loc;i < num.length;i++){
if(start){
next(num,i+1,num[i],count+1,false);
}else{
if(height>=num[i]){
next(num,i+1,num[i],count+1,false);
}
}
}
}
}
}