본문 바로가기

java9

[백준] 10828 스택 - C++, Java https://www.acmicpc.net/problem/10828 문제 풀이 C++ #include #include int stack[100001]; int main() { int n, i, key = -1; char input[6]; scanf("%d", &n); for(i = 0; i < n; i++) { scanf("%s", input); if(strcmp(input, "push") == 0) { scanf("%d", &stack[++key]); } else if(strcmp(input, "pop") == 0) { if(key == -1) printf("-1\n"); else printf("%d\n", stack[key--]); } else if(strcmp(input, "size") == 0) .. 2023. 7. 18.
[프로그래머스] 더 맵게 - Java https://school.programmers.co.kr/learn/courses/30/lessons/42626 문제 설명 문제 풀이 import java.util.*; class Solution { public int solution(int[] scoville, int K) { int answer = 0; Queue list = new PriorityQueue(); for (int i : scoville) { list.offer(i); } while(list.peek() < K) { if (list.size() == 1) return -1; int s1 = list.poll(); int s2 = list.poll(); list.offer(s1 + s2 * 2); answer++; } return an.. 2023. 7. 15.
[프로그래머스] 타겟 넘버 - Java https://school.programmers.co.kr/learn/courses/30/lessons/43165 문제 설명 문제 풀이 class Solution { public int solution(int[] numbers, int target) { return count(numbers, target, 0, 0); } int count(final int[] numbers, int target, int i, int sum) { if(i == numbers.length) { if(sum == target) return 1; return 0; } return count(numbers, target, i+1, sum + numbers[i]) + count(numbers, target, i+1, sum - n.. 2023. 7. 14.
[프로그래머스] 스킬트리 - Java https://school.programmers.co.kr/learn/courses/30/lessons/49993 문제설명 문제 풀이 class Solution { public int solution(String skill, String[] skill_trees) { int answer = 0; for (String s : skill_trees) { String s1 = s.replaceAll("[^"+skill+"]", ""); if (skill.startsWith(s1)) answer++; } return answer; } } 2023. 7. 12.

티스토리툴바