add 896

Steve Sun · Steve Sun · commit 67a1978a8669 · 2018-09-05T20:42:17.000-07:00
diff --git a/README.md b/README.md
@@ -22,6 +22,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|896|[Monotonic Array](https://leetcode.com/problems/monotonic-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_896.java) | O(n) | O(1) | |Easy|
 |844|[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_844.java) | O(n) | O(1) | |Easy|
 |832|[Flipping an Image](https://leetcode.com/problems/flipping-an-image/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_832.java) | O(n) | O(1) | |Easy|
 |830|[Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_830.java) | O(n) | O(n) | |Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_896.java b/src/main/java/com/fishercoder/solutions/_896.java
@@ -0,0 +1,71 @@
+package com.fishercoder.solutions;
+
+/**
+ * 896. 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
+ */
+public class _896 {
+    public static class Solution1 {
+        public boolean isMonotonic(int[] A) {
+            int i = 0;
+            for (; i < A.length - 1; i++) {
+                if (A[i] <= A[i+1]) {
+                    continue;
+                } else {
+                    break;
+                }
+            }
+            if (i == A.length - 1) {
+                return true;
+            }
+            i = 0;
+            for (; i < A.length - 1; i++) {
+                if (A[i] >= A[i+1]) {
+                    continue;
+                } else {
+                    break;
+                }
+            }
+            return i == A.length - 1;
+        }
+    }
+
+    public static void main(String... args) {
+        int[] A = new int[]{1, 3, 2};
+        Solution1 solution1 = new Solution1();
+        System.out.println(solution1.isMonotonic(A));
+    }
+}
