solve: 프로그래머스 문제 풀이 - 9일차

Author: OhChangEun

2025-08-21/오창은/[solved] 프로그래머스_두 큐 합 같게 만들기.java

@@ -0,0 +1,51 @@
+import java.util.*;
+
+class Solution {
+    public int solution(int[] queue1, int[] queue2) {    
+        
+        long total = 0;
+        int size = queue1.length;     
+        long sum1 = 0;
+        long sum2 = 0;
+        for (int i=0; i<size; i++) {
+            sum1 += queue1[i];
+       		sum2 += queue2[i]; 
+        }
+        
+        total = sum1 + sum2;  
+        if (total % 2 != 0) return -1;
+      	long target = total / 2; 
+        
+        Queue<Integer> q1 = new LinkedList<>();
+        Queue<Integer> q2 = new LinkedList<>();
+        for (int i=0; i<size; i++) {
+            q1.offer(queue1[i]);
+            q2.offer(queue2[i]);
+        }
+                
+       	int moveCount = 0;
+        boolean isSuccess = false;
+        while (moveCount <= 3*size) {
+            if (sum1 == target) {
+                return moveCount;
+            } 
+            
+            int move = 0;
+            if (target < sum2) {
+               	move = q2.poll();
+                q1.offer(move);
+                sum1 += move;
+                sum2 -= move;
+            } else if (sum1 > target) {
+               	move = q1.poll();
+                q2.offer(move);
+                sum2 += move;
+                sum1 -= move;
+            } 
+        	moveCount++; 
+
+        }
+        
+        return -1;
+    }
+}

2025-08-21/오창은/[solved] 프로그래머스_마법의 엘리베이터.java

@@ -0,0 +1,24 @@
+class Solution {
+    public int solution(int storey) {
+        int answer = 0;
+        
+        while (storey > 0) {
+           	int num10 = storey / 10; 
+            int num0 = storey % 10;
+            if (num0 > 5) {
+                num10 += 1;
+				answer += 10 - num0;
+            } else if (num0 < 5) {
+                answer += num0;
+            } else {
+                if (num10 % 10 >= 5) {
+                    num10 += 1;
+                }
+                answer += num0; // 숫자 5
+            }
+           	storey = num10;
+        }
+        
+        return answer;
+    }
+}

2025-08-21/오창은/[solved] 프로그래머스_연속된 부분 수열의 합.java

@@ -0,0 +1,45 @@
+class Solution {
+    public int[] solution(int[] sequence, int k) {
+        int[] answer = {};
+      
+        int size = sequence.length;
+        int[] sum = new int[size + 1];
+      
+        // 1 2 3 4 5
+        // 0 1 3 6 10 15
+        for (int i=1; i<=size; i++) {
+            sum[i] = sum[i-1] + sequence[i-1];
+        }
+       
+        int start = 0;
+        int end = 0;
+        int left = 0;
+        int minLen = size;
+        for (int right = 0; right < size; right++) {
+            while (left <= right) {
+           		int rangeSum = sum[right + 1] - sum[left];
+                if (rangeSum == k) {
+                    int len = right - left + 1;
+                   	if (len < minLen) {
+                        minLen = len;
+                        start = left; 
+                        end = right; 
+                    }
+                    ++left;
+                    break;
+                } else if (rangeSum > k) {
+                    left++;
+                } else {
+                    break; 
+                }
+            }
+        }
+       
+        /*
+        for (int s: sum) {
+            System.out.println(s + " ");
+        }
+        */
+        return new int[] { start, end };
+    }
+}