Time: 3 ms (17.90%) | Memory: 17.7 MB (88.19%) - LeetSync

Author: kika1s1

2316-count-hills-and-valleys-in-an-array/count-hills-and-valleys-in-an-array.py

@@ -0,0 +1,12 @@
+class Solution:
+    def countHillValley(self, nums: List[int]) -> int:
+        ans = 0
+        no_duplicate = [nums[0]]
+        for i in range(1, len(nums)):
+            if no_duplicate[-1] !=nums[i]:
+                no_duplicate.append(nums[i])
+        print(no_duplicate)
+        for i in range(1, len(no_duplicate)-1):
+            if no_duplicate[i-1] < no_duplicate[i] > no_duplicate[i+1] or no_duplicate[i-1] >no_duplicate[i] < no_duplicate[i+1]:
+                ans +=1
+        return ans