public static boolean func(int[] arr) {
//给定一个整型数组, 判定数组是否有序(递增)
for (int i = 1; i < arr.length; i++) {
if(arr[i-1] > arr[i]){
return false;
}
}
return true;
}
public static void main(String[] args) {
int[] arr1 = {7,3,2,6,8,9};
int[] arr2 = {1,2,3,4,5,6,7};
System.out.println("arr1" +func(arr1));
System.out.println("arr2" +func(arr2));
}
输出结果: