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


