题解 | #有序序列判断#
有序序列判断
https://www.nowcoder.com/practice/22e87f8a8d764a6582710f38d1b40c6e
#include <stdio.h> int main() { int num; while (scanf("%d", &num) != EOF) { int arr[50] = {0}; for (int i = 0; i < num; i++) { scanf("%d",arr+i); } int flag1 = 0; int flag2 = 0; for (int j = 0; j < num - 1; j++) { if (arr[j] > arr[j + 1]) { flag1++; } if (arr[j] < arr[j+1]) { flag2++; } if (flag1 != 0 && flag2 != 0) { break; } } if (flag1 != 0 && flag2 != 0) { printf("unsorted\n"); } else { printf("sorted\n"); } } return 0; }