题解 | #HTTP状态码#
有序序列判断
http://www.nowcoder.com/practice/22e87f8a8d764a6582710f38d1b40c6e
import java.util.Scanner; public class Main{ public static void main(String[] args){ Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int[] arr = new int[n]; for(int i = 0;i < arr.length;i++){ arr[i] = scan.nextInt(); } boolean isFlag = false; for(int i = 0;i < arr.length - 2;i++){ if((arr[i] > arr[i+1])&&(arr[i+1] < arr[i+2])||(arr[i] < arr[i+1])&&(arr[i+1] > arr[i+2])){ System.out.println("unsorted"); isFlag = true; break;
}
}
if(!isFlag){
System.out.println("sorted");
}
}
}