my solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def sumOfGoodNumbers(self, nums: List[int], k: int) -> int:
        result=[]
        for i in range(len(nums)):
            if (i - k < 0 or nums[i] > nums[i - k]) and (i + k >= len(nums) or nums[i] > nums[i + k]):
                result.append(nums[i])
        return sum(result)
        
```
['Python3']