Algorithm118 [Algorithm / Programmers] 할인 행사 [Version] ⦁ 2024.04.07 / [Algorithm / Programmers] 할인 행사 import java.util.*; class Solution { public int solution(String[] wantedItems, int[] wantedQuantities, String[] discounts) { int answer = 0; int totalCount = Arrays.stream(wantedQuantities).sum(); Map wantedMap = createMap(wantedItems, wantedQuantities); for (int i = 0; i 2024. 4. 7. [Algorithm / Programmers] 연속 부분 수열 합의 개수 [Version] ⦁ 2024.04.07 / [Algorithm / Programmers] 연속 부분 수열 합의 개수 import java.util.*; class Solution { public int solution(int[] elements) { Set set = new HashSet(); int n = elements.length; for (int i = 0; i < n; i++) { int sum = 0; for (int j = 0; j < n; j++) { sum += elements[(i + j) % n]; set.add(sum); } } return set.size(); } } 2024. 4. 7. [Algorithm / Programmers] 2018 KAKAO BLIND RECRUITMENT-[1차] 캐시 [Version] ⦁ 2024.04.07 / [Algorithm / Programmers] 2018 KAKAO BLIND RECRUITMENT-[1차] 캐시 import java.util.*; class Solution { public int solution(int cacheSize, String[] cities) { if (cacheSize == 0) { return cities.length * 5; } LinkedList cache = new LinkedList(); int answer = 0; for (String city : cities) { String lowerCaseCity = city.toLowerCase(); if (cache.contains(lowerCaseCity)) { answer .. 2024. 4. 7. [Algorithm / Programmers] 2017 팁스타운-짝지어 제거하기 [Version] ⦁ 2024.04.04 / [Algorithm / Programmers] 2017 팁스타운-짝지어 제거하기 class Solution { public int solution(String s) { StringBuilder sb = new StringBuilder(); for (char c : s.toCharArray()) { if (sb.length() > 0 && sb.charAt(sb.length() - 1) == c) { sb.deleteCharAt(sb.length() - 1); } else { sb.append(c); } } return sb.length() == 0 ? 1 : 0; } } 2024. 4. 4. [Algorithm / Programmers] 피보나치 수 [Version] ⦁ 2024.04.04 / [Algorithm / Programmers] 피보나치 수 class Solution { public int solution(int n) { int[] fibSequence = new int[n + 1]; fibSequence[0] = 0; fibSequence[1] = 1; for(int i = 2; i 2024. 4. 4. [Algorithm / Programmers] Summer/Winter Coding(~2018)-영어 끝말잇기 [Version] ⦁ 2024.04.04 / [Algorithm / Programmers] Summer/Winter Coding(~2018)-영어 끝말잇기 import java.util.*; class Solution { public int[] solution(int n, String[] words) { Set wordSet = new HashSet(); wordSet.add(words[0]); int[] answer = new int[2]; for (int i = 0; i < words.length - 1; i++) { String currentWord = words[i]; String nextWord = words[i + 1]; char lastChar = currentWord.charAt(curre.. 2024. 4. 4. [Algorithm / Programmers] Summer/Winter Coding(~2018)-점프와 순간 이동 [Version] ⦁ 2024.04.04 / [Algorithm / Programmers] Summer/Winter Coding(~2018)-점프와 순간 이동 import java.util.*; public class Solution { public int solution(int num) { int count = 0; while(num >= 1) { if(num % 2 == 0) { num /= 2; continue; } num--; count++; } return count; } } 2024. 4. 4. [Algorithm / Programmers] 구명보트 [Version] ⦁ 2024.04.04 / [Algorithm / Programmers] 구명보트 import java.util.*; class Solution { public int solution(int[] people, int limit) { int boat = 0; // 몸무게 순으로 정렬 Arrays.sort(people); // 인덱스 선언 int firstIndex = 0; int lastIndex = people.length - 1; while(firstIndex 2024. 4. 4. [Algorithm / Programmers] N개의 최소공배수 [Version] ⦁ 2024.04.04 / [Algorithm / Programmers] N개의 최소공배수 import java.util.*; class Solution { public int solution(int[] numbers) { // 주어진 숫자들의 최소공배수 계산 int lcm = numbers[0]; for (int i = 1; i < numbers.length; i++) { lcm = calculateLCM(lcm, numbers[i]); } return lcm; } // 최대공약수 구하기 private int calculateGCD(int a, int b) { while (b != 0) { int temp = b; b = a % b; a = temp; } return a; } // 최.. 2024. 4. 4. 이전 1 2 3 4 5 ··· 14 다음
