题解 | 牛牛的计划
牛牛的计划
https://www.nowcoder.com/practice/cf956ceef9f84f7393a0b7284fdbf95a
逐两位比较
import java.util.Scanner;
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
// 注意 hasNext 和 hasNextLine 的区别
if (in.hasNextLine()) { // 注意 while 处理多个 case
int y = in.nextInt();
int m = in.nextInt();
int d = in.nextInt();
int y1 = in.nextInt();
int m1 = in.nextInt();
int d1 = in.nextInt();
boolean started = false;
int[] dates = {y, y1, m, m1, d, d1};
for (int i = 0; i < dates.length; i = i + 2) {
if (i == dates.length - 2) if (dates[i] == dates[i + 1]) started = true;
if (dates[i] < dates[i + 1]) { started = true; break; }
if (dates[i] > dates[i + 1]) break;
}
if (started) System.out.println("yes");
else System.out.println("no");
}
}
}