System.out.println("ci:" + ci + ", cj:" + cj);
} else { System.out.println("ci:" + ci + ", cj:" + cj + ", pi:" + pi + ", pj:" + pj);
} for (int j = 0; j < map[i].length; j++) {
if (ci == pi && cj == pj) {
System.out.print(((ci == i && cj == j) ? "[" + map[i][j] + "]" : " " + map[i][j] + " ") + " ");
} else {
System.out.print(
((ci == i && cj == j || pi == i && pj == j) ? "[" + map[i][j] + "]" : " " + map[i][j] + " ")
+ " ");
}
}
System.out.println();
}首先是比较ci == pi 并且 cj == pj,如果都相等,输出cicj
否则分别输出ci cj pi pj
然后进行循环,如果ci == pi并且 cj == pj,进行三目表达式ci == i 且 cj == j,
如果成立输出[map[i][j] ] 否则输出 map[i][j]
如果ci == pi并且 cj == pj不成立,进行三目表达式(ci == i && cj == j || pi == i && pj == j)
如果成立输出[map[i][j] ] 否则输出 map[i][j]