题解 | #有序序列判断#
有序序列判断
https://www.nowcoder.com/practice/22e87f8a8d764a6582710f38d1b40c6e
#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> int main() { int n = 0; int zu[100] = { 0 }; int i1, i; scanf("%d", &n); for (i1 = 0; i1 < n; i1++) { scanf("%d", &zu[i1]); } int c = 0; for (i = 0; i < n-1; i++) { if ((zu[i+1] - zu[i]) >= 0) { if (c == 2) { printf("unsorted"); break; } c = 1; } else if ((zu[i + 1] - zu[i]) < 0) { if (c == 1) { printf("unsorted"); break; } c = 2; } } if (i == n - 1) { printf("sorted"); } return 0; }