forked from YuriSpiridonov/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
896.MonotonicArray.py
45 lines (35 loc) · 1 KB
/
896.MonotonicArray.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
'''
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:
Input: [1,2,2,3]
Output: true
Example:
Input: [6,5,4,4]
Output: true
Example:
Input: [1,3,2]
Output: false
Example:
Input: [1,2,4,5]
Output: true
Example:
Input: [1,1,1]
Output: true
Note:
1. 1 <= A.length <= 50000
2. -100000 <= A[i] <= 100000
'''
#Difficulty: Easy
#366 / 366 test cases passed.
#Runtime: 440 ms
#Memory Usage: 20.6 MB
#Runtime: 440 ms, faster than 93.04% of Python3 online submissions for Monotonic Array.
#Memory Usage: 20.6 MB, less than 14.35% of Python3 online submissions for Monotonic Array.
class Solution:
def isMonotonic(self, A: List[int]) -> bool:
return sorted(A) in [A, A[::-1]]