Hyerin's Logs

풀이class Solution { public int numberOfSubarrays(int[] nums, int k) { HashMap 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; }}

풀이class Solution { public int subarraySum(int[] nums, int k) { Map hashMap = new HashMap(); int curr = 0; int answer = 0; hashMap.put(0,1); for(int i=0;i

풀이class Solution { public boolean areOccurrencesEqual(String s) { HashMap hashMap = new HashMap(); for(Character c: s.toCharArray()) { hashMap.put(c, hashMap.getOrDefault(c, 0)+1); } int k = hashMap.get(s.charAt(0)); for(Integer value: hashMap.values()) { if(k != value) return false; } return true; }} 다른 ..

풀이class Solution { public List intersection(int[][] nums) { HashMap hashMap = new HashMap(); ArrayList answer = new ArrayList(); int k = nums.length; for(int i=0;i 다른 사람 풀이 for문for (int[] arr: nums) { for (int x: arr) { counts.put(x, counts.getOrDefault(x, 0) + 1); }}

풀이class Solution { public char repeatedCharacter(String s) { Set seen = new HashSet(); for(int i=0;i

풀이class Solution { public int[] twoSum(int[] nums, int target) { Map dic = new HashMap(); for(int i=0; i

풀이class Solution { public int[] getAverages(int[] nums, int k) { long[] prefix = new long[nums.length]; int[] answer = new int[nums.length]; prefix[0] = nums[0]; for(int i=1; i=0 && i+k 0)? prefix[i-k-1] : 0))/(2*k+1)); else answer[i]=-1; } return answer; }} 오늘 Arrays and Strings 完!