solve problem Monotonic Array

P-ppc · P-ppc · commit 04fd222f22b2 · 2018-10-13T14:40:56.000+08:00
diff --git a/README.md b/README.md
@@ -300,6 +300,7 @@ All solutions will be accepted!
 |103|[Binary Tree Zigzag Level Order Traversal](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal/description/)|[java/py/js](./algorithms/BinaryTreeZigzagLevelOrderTraversal)|Medium|
 |134|[Gas Station](https://leetcode-cn.com/problems/gas-station/description/)|[java/py/js](./algorithms/GasStation)|Medium|
 |238|[Product Of Array Except Self](https://leetcode-cn.com/problems/product-of-array-except-self/description/)|[java/py/js](./algorithms/ProductOfArrayExceptSelf)|Medium|
+|896|[Monotonic Array](https://leetcode-cn.com/problems/monotonic-array/description/)|[java/py/js](./algorithms/MonotonicArray)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|
diff --git a/algorithms/MonotonicArray/README.md b/algorithms/MonotonicArray/README.md
@@ -0,0 +1,2 @@
+# Monotonic Array
+This problem is easy to solve
diff --git a/algorithms/MonotonicArray/Solution.java b/algorithms/MonotonicArray/Solution.java
@@ -0,0 +1,13 @@
+class Solution {
+    public boolean isMonotonic(int[] A) {
+        int v = 0;
+        for (int i = 1; i < A.length; i++) {
+            if (A[i - 1] > A[i])
+                v |= 1;
+            else if (A[i - 1] < A[i])
+                v |= 2;
+        }
+
+        return v != 3;
+    }
+}
diff --git a/algorithms/MonotonicArray/solution.js b/algorithms/MonotonicArray/solution.js
@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} A
+ * @return {boolean}
+ */
+var isMonotonic = function(A) {
+    let v = 0
+    for (let i = 1; i < A.length; i++) {
+        if (A[i - 1] > A[i])
+            v |= 1
+        else if (A[i - 1] < A[i])
+            v |= 2
+    }
+    
+    return v != 3
+};
diff --git a/algorithms/MonotonicArray/solution.py b/algorithms/MonotonicArray/solution.py
@@ -0,0 +1,14 @@
+class Solution(object):
+    def isMonotonic(self, A):
+        """
+        :type A: List[int]
+        :rtype: bool
+        """
+        v = 0
+        for i in xrange(1, len(A)):
+            if A[i - 1] > A[i]:
+                v |= 1
+            elif A[i - 1] < A[i]:
+                v |= 2
+        
+        return v != 3

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,2 @@`
	`1`	`+# Monotonic Array`
	`2`	`+This problem is easy to solve`