leetcode Day30----array.easy

Monotonic Array

An array is monotonic if it is either monotone increasing or monotone decreasing.

An array A is monotone increasing if for all i <= j, A[i] <= A[j]. An array A is monotone decreasing if for all i <= j, A[i] >= A[j].

Return true if and only if the given array A is monotonic.

Example 1:

Input: [1,2,2,3]
Output: true
Example 2:

Input: [6,5,4,4]
Output: true
Example 3:

Input: [1,3,2]
Output: false
Example 4:

Input: [1,2,4,5]
Output: true
Example 5:

Input: [1,1,1]
Output: true

Note:

1 <= A.length <= 50000
-100000 <= A[i] <= 100000

C语言

bool isMonotonic(int* A, int ASize){
    if(ASize<3){return true;}
    else{
        int i=2;
        while(i<ASize){
            while(((A[i-1]-A[i-2])==0)&&(i<ASize-1)){i++;}
            int a=A[i-1]-A[i-2];
            while(((A[i]-A[i-1])==0)&&(i<ASize-1)){i++;}
            int b=A[i]-A[i-1];
            if(a*b<0)return false;
            i++;
        }
    }
    return true;
}

Success
Details
Runtime: 60 ms, faster than 9.00% of C online submissions for Monotonic Array.
Memory Usage: 10.7 MB, less than 100.00% of C online submissions for Monotonic Array.

JAVA

python3

class Solution:
    def isMonotonic(self, A: List[int]) -> bool:
        if((sorted(A)==A)or(sorted(A,reverse=True)==A)):
            return True
        else:
            return False

Success
Details
Runtime: 108 ms, faster than 51.74% of Python3 online submissions for Monotonic Array.
Memory Usage: 17.3 MB, less than 5.11% of Python3 online submissions for Monotonic Array.