풀이
class Solution {
public int numberOfSubarrays(int[] nums, int k) {
HashMap<Integer, Integer> hashMap = new HashMap<>();
int curr = 0;
int answer = 0;
hashMap.put(0,1);
for(int num: nums) {
curr += num%2;
answer += hashMap.getOrDefault(curr - k, 0);
hashMap.put(curr, hashMap.getOrDefault(curr, 0)+1);
}
return answer;
}
}
'Software Engineering > Algorithm' 카테고리의 다른 글
[LeetCode] #560 Subarray Sum Equals K (0) | 2024.07.06 |
---|---|
[LeetCode] #1941 Check if All Characters Have Equal Number of Occurrences (0) | 2024.06.23 |
[LeetCode] #2248 Intersection of Multiple Arrays (0) | 2024.06.23 |
[LeetCode] First Letter to Appear Twice (1) | 2024.06.22 |
[LeetCode] Two Sum (0) | 2024.06.22 |