solves #2210: Count Hills and Valleys in an Array in java

Author: anishLearnsToCode

Diff for: README.md

@@ -720,7 +720,7 @@
 | 2194 | [Cells in a Range on an Excel Sheet](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet)                                                                 |                                                                                 [![Java](assets/java.png)](src/CellsInARangeOnAnExcelSheet.java)                                                                                 |                                                                                                                                   |
 | 2200 | [Find All K-Distant Indices in an Array](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array)                                                         |                                                                               [![Java](assets/java.png)](src/FindAllKDistantIndicesInAnArray.java)                                                                               |                                                                                                                                   |
 | 2206 | [Divide Array Into Equal Pairs](https://leetcode.com/problems/divide-array-into-equal-pairs)                                                                           |                                                                                  [![Java](assets/java.png)](src/DivideArrayIntoEqualPairs.java)                                                                                  |                                                                                                                                   |
-| 2210 | [Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array)                                                               |                                                                                                                                                                                                                                  |                                                                                                                                   |
+| 2210 | [Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array)                                                               |                                                                                [![Java](assets/java.png)](src/CountHillsAndValleysInAnArray.java)                                                                                |                                                                                                                                   |
 | 2215 | [Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays)                                                                   |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2220 | [Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number)                                                               |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 2224 | [Minimum Number of Operations to Convert Time](https://leetcode.com/problems/minimum-number-of-operations-to-convert-time)                                             |                                                                                                                                                                                                                                  |                                                                                                                                   |

Diff for: src/CountHillsAndValleysInAnArray.java

@@ -0,0 +1,14 @@
+// https://leetcode.com/problems/count-hills-and-valleys-in-an-array
+
+public class CountHillsAndValleysInAnArray {
+    public int countHillValley(int[] array) {
+        int result = 0, left = array[0];
+        for (int index = 1 ; index < array.length - 1; index++) {
+            if ((left < array[index] && array[index] > array[index + 1]) || (left > array[index] && array[index] < array[index + 1])) {
+                result++;
+                left = array[index];
+            }
+        }
+        return result;
+    }
+}