判断一个二维数组中,是否满足每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序
public class demo01 {
public static void main(String args[]) {
int arrays [][]= {{1,3,4,9},{2,10,12,14},{3,12,13,20},{5,15,17,100}};
for (int i = 0; i < arrays.length; i++) {
for (int j = 0; j < arrays[i].length; j++) {
//行不变,不同列数相比较
int k1=arrays[i].length;
if(j+1<k1) {
if(arrays[i][j]<arrays[i][j+1]) {
}else {
System.out.println(arrays[i][j]+" "+arrays[i][j+1]+"排序不合理");
return ;
}
}
//列不变,不同行数据相比较
int k2=arrays[j].length;
if(i+1<k2) {
if(arrays[i][j]<arrays[i+1][j]) {
}else {
System.out.println(arrays[i][j]+arrays[i+1][j]+"数据不合理");
return ;
}
}
}
}
System.out.println("排序顺序正确!");
}
}