solves monotonic array

Author: anishLearnsToCode

Diff for: README.md

@@ -242,7 +242,7 @@
 | 888 | [Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap) | [![Java](assets/java.png)](src/FairCandySwap.java) |
 | 892 | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [![Java](assets/java.png)](src/SurfaceAreaOf3DShapes.java) |
 | 893 | [Groups of Special Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | |
-| 896 | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | |
+| 896 | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [![Java](assets/java.png)](src/MonotonicArray.java) |
 | 897 | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | |
 | 905 | [Sort Array by Parity](https://leetcode.com/problems/sort-array-by-parity) | |
 | 908 | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | |

Diff for: src/MonotonicArray.java

@@ -0,0 +1,19 @@
+public class MonotonicArray {
+    public boolean isMonotonic(int[] nums) {
+        return isMonotonicIncreasing(nums) || isMonotonicDecreasing(nums);
+    }
+
+    private boolean isMonotonicIncreasing(int[] array) {
+        for (int i = 1 ; i < array.length ; i++) {
+            if (array[i] < array[i - 1]) return false;
+        }
+        return true;
+    }
+
+    private boolean isMonotonicDecreasing(int[] array) {
+        for (int i = 1 ; i < array.length ; i++) {
+            if (array[i] > array[i - 1]) return false;
+        }
+        return true;
+    }
+}