https://github.com/emahtab/monotonic-array
https://github.com/emahtab/monotonic-array
leetcode monotonic-array problem-solving
Last synced: about 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/emahtab/monotonic-array
- Owner: eMahtab
- Created: 2019-12-25T06:42:59.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2019-12-25T06:45:40.000Z (almost 6 years ago)
- Last Synced: 2025-10-28T15:51:59.817Z (about 2 months ago)
- Topics: leetcode, monotonic-array, problem-solving
- Size: 1.95 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 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
```
### Implementation
```java
public boolean isMonotonic(int[] A) {
if(A == null){
return false;
}
if(A.length <= 1){
return true;
}
boolean increasing = true;
boolean decreasing = true;
for(int i = 0; i < A.length - 1; i++){
if(A[i] > A[i+1]){
increasing = false;
}
if(A[i] < A[i+1]){
decreasing = false;
}
}
return increasing || decreasing;
}
```