코딩 문제 풀이52 [백준] 자바 문제 풀이 2014 : 골드1 BOJ 2014 : 소수의 곱 import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { // TODO Auto-generated method stub BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); StringTokenizer str = new StringTokenizer(br.readLine(), " "); int k = Integer.p.. 2023. 10. 6. [백준] 자바 문제 풀이 1976 : 골드4 BOJ 1976 : 여행 가자 import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.StringTokenizer; import java.util.Vector; public class Main { public static void main(String[] args) throws Exception { // TODO Auto-generated method stub BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); int[][] board = new int[n][n].. 2023. 10. 6. [백준] 자바 문제 풀이 17299 : 골드3 BOJ 17299 : 오등큰수 import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.InputStreamReader; import java.io.OutputStreamWriter; import java.util.ArrayDeque; import java.util.Deque; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws Exception { // TODO Auto-generated method stub BufferedReader br = new BufferedReader(new InputSt.. 2023. 10. 6. [백준] 자바 문제 풀이 2357 : 골드1 BOJ 2357 : 최솟값과 최댓값 import java.io.*; import java.util.*; public class Main { static class SegmentTree{ private long[] max_tree; private long[] min_tree; SegmentTree(int n){ double treeHeight = Math.ceil(Math.log(n)/Math.log(2))+1; long treeNodeCount = Math.round(Math.pow(2, treeHeight)); max_tree = new long[Math.toIntExact(treeNodeCount)]; min_tree = new long[Math.toIntExact(treeNodeCount)]; } .. 2023. 10. 6. [프로그래머스] Lv3 문제풀이3(feat. JAVA) 등굣길 - Dynamic Programming class Solution { public long[][] dp; public int solution(int m, int n, int[][] puddles) { int answer = 0; dp = new long[n+1][m+1]; dp[1][1] = 1; for(int[] a : puddles) dp[a[1]][a[0]] = -1; for(int i = 1; i o1.end - o2.end); ArrayList result = new ArrayList(); int last = -30_001; for(int i = 0; i last) { last = route.. 2023. 10. 6. [프로그래머스] Lv3 문제풀이2(feat. JAVA) 야근 지수 import java.util.*; class Solution { public long solution(int n, int[] works) { long answer = 0; Arrays.sort(works); long[] cnt = new long[works[works.length-1] + 1]; long sum = 0; for(int a : works) { sum += a; cnt[a]++; } if(sum 1; i--) { if(cnt[i] < n) { cnt[i-1] += cnt[i]; n -= cnt[i]; cnt[i] = 0; } else { cnt[i] -= n; cnt[i-1] += n; n = 0; break; } } if(n!=0) cnt[1] -= n; for(int i = .. 2023. 10. 6. [프로그래머스] Lv3 문제풀이1(feat. JAVA) 정수 삼각형 - Dynamic Programming import java.io.*; import java.util.*; class Solution { public int solution(int[][] triangle) { int answer = 0; int[][] dp = new int[triangle.length][triangle[triangle.length-1].length]; dp[0][0] = triangle[0][0]; for(int i = 1; i < triangle.length; i++) { for(int j = 0; j < i + 1; j++) { if(j == 0) { dp[i][j] = dp[i-1][j] + triangle[i][j]; } else if (j == i) { dp[i][.. 2023. 10. 4. [백준] 자바 문제 풀이 1766 : 골드2 BOJ 1766 : 문제집 풀이 코드 import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.LinkedList; import java.util.List; import java.util.PriorityQueue; import java.util.Queue; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws Exception { // TODO Auto-generated method stub BufferedReader br = new Buffe.. 2023. 10. 4. [백준] 자바 문제 풀이 2696 : 골드2 BOJ 2696 : 중앙값 구하기 풀이 코드 import java.io.BufferedReader; import java.io.InputStreamReader; import java.util.ArrayList; import java.util.LinkedList; import java.util.List; import java.util.PriorityQueue; import java.util.Queue; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws Exception { // TODO Auto-generated method stub BufferedReader br = new B.. 2023. 10. 4. [백준] 자바 문제 풀이 2042 : 골드1 BOJ 2042 : 구간 합 구하기 풀이 코드 import java.io.*; import java.util.*; public class Main { static class SegmentTree { private long[] tree; SegmentTree(int n){ double height = Math.ceil(Math.log(n)/Math.log(2))+1; long size = Math.round(Math.pow(2, height)); tree = new long[Math.toIntExact(size)]; } long init(long[] arr, int node, int start, int end) { if(start == end) return tree[node] = arr[start]; re.. 2023. 10. 4. [백준] 자바 문제 풀이 1781 : 골드2 BOJ 1781 : 컵라면 풀이 코드 import java.io.*; import java.util.*; public class Main { static class Problem { int ramen; int time; Problem(int time, int ramen) { this.ramen = ramen; this.time = time; } } public static void main(String[] args) throws Exception { // TODO Auto-generated method stub BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWri.. 2023. 10. 4. [백준] 자바 문제 풀이 1253 : 골드4 BOJ 1253 : 좋다 풀이 코드 import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws Exception{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); int n = Integer.parseInt(br.readLine()); int[] arr = new int[n]; StringTokenizer str = new StringTokenizer(br.rea.. 2023. 9. 26. 이전 1 2 3 4 5 다음 728x90 반응형