-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathDay 24.2.txt
57 lines (41 loc) · 1.07 KB
/
Day 24.2.txt
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
896. Monotonic Array
An array is monotonic if it is either monotone increasing or monotone decreasing.
An array nums is monotone increasing if for all i <= j, nums[i] <= nums[j]. An array nums is monotone decreasing if for all i <= j, nums[i] >= nums[j].
Return true if and only if the given array nums is monotonic.
Example 1:
Input: nums = [1,2,2,3]
Output: true
Example 2:
Input: nums = [6,5,4,4]
Output: true
Example 3:
Input: nums = [1,3,2]
Output: false
Example 4:
Input: nums = [1,2,4,5]
Output: true
Example 5:
Input: nums = [1,1,1]
Output: true
Note:
1 <= nums.length <= 50000
-100000 <= nums[i] <= 100000
class Solution {
public boolean isMonotonic(int[] n) {
int i,c=0,m=0;
for(i=0;i<n.length-1;i++)
{
if(n[i+1]>=n[i])
c++;
}
for(i=0;i<n.length-1;i++)
{
if(n[i+1]<=n[i])
m++;
}
if(c==n.length-1||m==n.length-1)
return true;
else
return false;
}
}