Simple Esay C++ Solution 0ms ###
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
```cpp []
class Solution {
public:
    int sumOfGoodNumbers(vector<int>& nums, int k) {
        int cnt = 0;
        
        for (int i = 0; i < nums.size(); i++) {
            bool isGood = true;

            if (i - k >= 0 && nums[i] <= nums[i - k]) {
                isGood = false;
            }

            if (i + k < nums.size() && nums[i] <= nums[i + k]) {
                isGood = false;
            }

            if (isGood==true) {
                cnt += nums[i];
            }
        }

        return cnt;
    }
};

```
['C++']