题解 | #有序序列判断#
有序序列判断
https://www.nowcoder.com/practice/22e87f8a8d764a6582710f38d1b40c6e
#include <stdio.h>
#include<string.h>
int main() {
int n;
scanf("%d",&n);
int a[n];
for(int i = 0;i<n;i++)
{
scanf("%d",&a[i]);
}
int cou=0,dou =0,eou = 0;
for(int j = 0;j<n-1;j++)
{
if(a[j]<a[j+1])
cou++;
if(a[j]>a[j+1])
dou++;
if(a[j]==a[j+1])
eou++;
}
if(cou==n-1||dou==n-1||eou==n-1)
printf("sorted");
else
printf("unsorted");
return 0;
}
查看12道真题和解析