forked from mohitjain/leetcode_solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path896_monitonic_array.rb
More file actions
65 lines (57 loc) · 1.34 KB
/
896_monitonic_array.rb
File metadata and controls
65 lines (57 loc) · 1.34 KB
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
# Leetcode Problem: https://leetcode.com/problems/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
# ----------------------------------------------------------------------------------------------------------------------
# @param {Integer[]} a
# @return {Boolean}
def is_monotonic(a)
return true if [0, 1].include? a.length
increasing = nil
a.length.times do |index|
next if index.zero?
increasing = a[index - 1] < a[index] if increasing.nil? && a[index - 1] != a[index]
next if increasing.nil? && a[index - 1] == a[index]
if increasing
return false if a[index] < a[index - 1]
else
return false if a[index] > a[index - 1]
end
end
true
end
p is_monotonic [1, 2, 2, 3]
p is_monotonic [6, 5, 4, 4]
p is_monotonic [1, 3, 2]
p is_monotonic [1, 2, 4, 5]