[Week05] BOJ 6236: 용돈 관리

Author: JAEHEE25

personal/JAEHEE25/PGS/문자열_압축.java

@@ -0,0 +1,46 @@
+import java.util.*;
+
+class Solution {
+    public int solution(String s) {
+        int answer = Integer.MAX_VALUE;
+        int len = 1; //단위
+        int N = s.length();
+
+        while (len <= N) {
+            StringBuilder resultBuilder = new StringBuilder();
+            StringBuilder wordBuilder = new StringBuilder();
+            String prev = "";
+            String word = "";
+            int cnt = 0;
+            for (int i = 0; i <= N; i++) {
+                word = wordBuilder.toString();
+                if (word.length() == len) {
+                    if (prev.equals("")) { //맨 처음일 경우 prev에 저장
+                        prev = word;
+                        cnt++;
+                    } else if (prev.equals(word)) { //연속된 단어일 경우 개수 카운트
+                        cnt++;
+                    } else { //새로운 단어일 경우 이전 단어 기록
+                        if (cnt <= 1) resultBuilder.append(prev);
+                        else resultBuilder.append(cnt + prev);
+                        prev = word;
+                        cnt = 1;
+                    }
+                    wordBuilder = new StringBuilder(); //초기화
+                }
+                if (i < N) wordBuilder.append(s.charAt(i));
+            }
+
+            //마지막 처리
+            if (cnt <= 1) resultBuilder.append(prev);
+            else resultBuilder.append(cnt + prev);
+            resultBuilder.append(wordBuilder.toString()); //남은 글자들
+
+            //정답 구하기
+            answer = Math.min(resultBuilder.length(), answer);
+            len++;
+        }
+
+        return answer;
+    }
+}

weekly/week05/BOJ_6236_용돈관리/JAEHEE25.java

@@ -0,0 +1,51 @@
+package week05.BOJ_6236_용돈관리;
+
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+
+class BOJ6236 {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int N = Integer.parseInt(st.nextToken());
+        int M = Integer.parseInt(st.nextToken());
+        int[] money = new int[N];
+        int max = 0;
+        for (int i = 0; i < N; i++) {
+            money[i] = Integer.parseInt(br.readLine());
+            max = Math.max(money[i], max); //최대 금액을 최솟값으로 설정
+        }
+
+        int answer = 0;
+        int left = max;
+        int right = 10000 * 100000;
+        while (left <= right) {
+            int K = (left + right) / 2;
+
+            //결과 계산
+            int result = getWithdrawCnt(money, K, M);
+
+            if (M >= result) {
+                answer = K;
+                right = K - 1;
+            } else {
+                left = K + 1;
+            }
+        }
+        System.out.println(answer);
+    }
+
+    static int getWithdrawCnt(int[] money, int K, int M) {
+        int withdrawCnt = 1;
+        int now = K;
+        for (int i = 0; i < money.length; i++) {
+            if (money[i] > now) { //모자라면 K원 인출
+                withdrawCnt++;
+                now = K;
+            }
+            now -= money[i];
+        }
+        return withdrawCnt;
+    }
+}