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