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