add 2210

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty  | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------
+| 2210 |[Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2210.java)                                                                     || Easy                                                                          ||
 | 2201 |[Count Artifacts That Can Be Extracted](https://leetcode.com/problems/count-artifacts-that-can-be-extracted/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2201.java)                                                                     || Medium                                                                          ||
 | 2200 |[Find All K-Distant Indices in an Array](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2200.java)                                                                     || Easy                                                                          ||
 | 2194 |[Cells in a Range on an Excel Sheet](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2194.java)                                                                     || Easy                                                                          ||

src/main/java/com/fishercoder/solutions/_2210.java

@@ -0,0 +1,47 @@
+package com.fishercoder.solutions;
+
+public class _2210 {
+    public static class Solution1 {
+        public int countHillValley(int[] nums) {
+            int ans = 0;
+            for (int i = 1; i < nums.length - 1; i++) {
+                if (nums[i] == nums[i - 1]) {
+                    continue;
+                } else if (nums[i] > nums[i - 1]) {
+                    int tmp = i;
+                    boolean moved = false;
+                    while (tmp + 1 < nums.length && nums[tmp] == nums[tmp + 1]) {
+                        moved = true;
+                        tmp++;
+                    }
+                    if (moved) {
+                        if (tmp + 1 < nums.length && nums[i] > nums[tmp + 1]) {
+                            ans++;
+                        }
+                    } else {
+                        if (nums[i] > nums[i + 1]) {
+                            ans++;
+                        }
+                    }
+                } else if (nums[i] < nums[i - 1]) {
+                    int tmp = i;
+                    boolean moved = false;
+                    while (tmp + 1 < nums.length && nums[tmp] == nums[tmp + 1]) {
+                        moved = true;
+                        tmp++;
+                    }
+                    if (moved) {
+                        if (tmp + 1 < nums.length && nums[i] < nums[tmp + 1]) {
+                            ans++;
+                        }
+                    } else {
+                        if (nums[i] < nums[i + 1]) {
+                            ans++;
+                        }
+                    }
+                }
+            }
+            return ans;
+        }
+    }
+}