题解 | #Redraiment的走法#,这样更好理解一点
Redraiment的走法
http://www.nowcoder.com/practice/24e6243b9f0446b081b1d6d32f2aa3aa
import java.util.Scanner;
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
// 注意 hasNext 和 hasNextLine 的区别
while (in.hasNextInt()) { // 注意 while 处理多个 case
int n = in.nextInt();
int[] ints = new int[n];
for (int i = 0; i < n; i++) {
ints[i] = in.nextInt();
}
int[] countArr = new int[n];
int maxCount = 0;
for (int i = 1; i < n; i++) {
for (int j = 0; j < i; j++) {
if (ints[j] < ints[i]){
countArr[i] = Math.max(countArr[j] + 1, countArr[i]);
}
}
maxCount = Math.max(maxCount,countArr[i]);
}
// 包括自身,加1
System.out.println(maxCount + 1);
}
}
}