896_monotonic_array.py

class Solution:
    def isMonotonic(self, A: List[int]) -> bool:
        
        def check_increasing(nums: List[int]) -> bool:
            ans = True
            for i in range(len(nums)-1):
                if nums[i] > nums[i+1]:
                    ans = False
                    break
            return ans
        
        if A[0] < A[len(A)-1]:
            return check_increasing(A)
        elif A[0] > A[len(A)-1]:
            A.reverse()
            return check_increasing(A)
        else:
            B = A
            B.reverse()
            return check_increasing(A) or check_increasing(B)

'''
    This is my personal record of solving Leetcode Problems. 
    If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
    Copyright (C) 2020-2022  mengxinayan

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
'''