这道题极其容易超出数组范围。所以这道题的灵活处理似乎解决了这类麻烦。
public class Solution {
public bool IsMonotonic(int[] A) {
if (A.Length == 0 || A.Length == 1) return true;
bool res = true;
//0降序
//1升序
int b = A[0] > A[A.Length - 1] ? 0 : 1;
if (b==0)
{
for (int i = 1,j=i-1; i <= A.Length-1; i++,j++)
{
if (A[j] < A[i])
{
res = false;
break;
}
}
}
else
{
for (int i = 1,j=i-1; i <= A.Length-1; i++,j++)
{
if (A[j] > A[i])
{
res = false;
break;
}
}
}
return res;
}
}