[박수진][260709] 10, 11주차 제출

[실전모의코테]/08회차/박수진/대장균의 크기에 따라 분류하기 1.sql

@@ -0,0 +1,11 @@
+SELECT 
+    id,
+    (
+        CASE 
+            WHEN size_of_colony <= 100 THEN "LOW"
+            WHEN size_of_colony <= 1000 THEN "MEDIUM"
+            ELSE "HIGH"
+        END
+    ) as size
+FROM ecoli_data
+ORDER BY id;

[실전모의코테]/08회차/박수진/보호소에서 중성화한 동물.sql

@@ -0,0 +1,12 @@
+SELECT
+    o.animal_id,
+    o.animal_type,
+    o.name
+FROM animal_ins i
+JOIN animal_outs o
+    ON i.animal_id = o.animal_id
+WHERE
+    i.sex_upon_intake LIKE 'Intact%'
+AND (o.sex_upon_outcome LIKE 'Neutered%'
+    OR o.sex_upon_outcome LIKE 'Spayed%')
+ORDER BY o.animal_id;

[실전모의코테]/08회차/박수진/비밀지도.java

@@ -0,0 +1,22 @@
+class Solution {
+    public String[] solution(int n, int[] arr1, int[] arr2) {
+        String[] answer = new String[n];
+
+        for (int i = 0; i < n; i++) {
+            int merged = arr1[i] | arr2[i];
+
+            String row = Integer.toBinaryString(merged);
+
+            while (row.length() < n) {
+                row = "0" + row;
+            }
+
+            row = row.replace('1', '#');
+            row = row.replace('0', ' ');
+
+            answer[i] = row;
+        }
+
+        return answer;
+    }
+}

[실전모의코테]/08회차/박수진/특정 기간동안 대여 가능한 자동차들의 대여비용 구하기.sql

@@ -0,0 +1,21 @@
+SELECT
+    c.car_id,
+    c.car_type,
+    FLOOR(c.daily_fee * 30 * (100 - p.discount_rate) / 100) AS fee
+FROM car_rental_company_car c
+JOIN car_rental_company_discount_plan p
+    ON c.car_type = p.car_type
+   AND p.duration_type = '30일 이상'
+WHERE c.car_type IN ('세단', 'SUV')
+  AND c.car_id NOT IN (
+        SELECT car_id
+        FROM car_rental_company_rental_history
+        WHERE start_date <= '2022-11-30'
+          AND end_date >= '2022-11-01'
+  )
+  AND FLOOR(c.daily_fee * 30 * (100 - p.discount_rate) / 100)
+      BETWEEN 500000 AND 1999999
+ORDER BY
+    fee DESC,
+    c.car_type ASC,
+    c.car_id DESC;

박수진/260709_연도별 대장균 크기의 편차 구하기.sql

@@ -0,0 +1,14 @@
+SELECT
+    YEAR(E.DIFFERENTIATION_DATE) AS YEAR,
+    M.MAX_SIZE - E.SIZE_OF_COLONY AS YEAR_DEV,
+    E.ID
+FROM ECOLI_DATA E
+JOIN (
+    SELECT
+        YEAR(DIFFERENTIATION_DATE) AS YEAR,
+        MAX(SIZE_OF_COLONY) AS MAX_SIZE
+    FROM ECOLI_DATA
+    GROUP BY YEAR(DIFFERENTIATION_DATE)
+) M
+ON YEAR(E.DIFFERENTIATION_DATE) = M.YEAR
+ORDER BY YEAR, YEAR_DEV;

박수진/260709_조건별로 분류하여 주문상태 출력하기.sql

@@ -0,0 +1,11 @@
+SELECT
+    ORDER_ID,
+    PRODUCT_ID,
+    OUT_DATE,
+    CASE
+        WHEN OUT_DATE IS NULL THEN '출고미정'
+        WHEN OUT_DATE <= '2022-05-01' THEN '출고완료'
+        ELSE '출고대기'
+    END AS 출고여부
+FROM FOOD_ORDER
+ORDER BY ORDER_ID;

박수진/260716_두 큐 합 같게 만들기.java

@@ -0,0 +1,50 @@
+import java.util.*;
+
+class Solution {
+    public int solution(int[] queue1, int[] queue2) {
+        Queue<Integer> q1 = new ArrayDeque<>();
+        Queue<Integer> q2 = new ArrayDeque<>();
+
+        long sum1 = 0;
+        long sum2 = 0;
+
+        for (int n : queue1) {
+            q1.offer(n);
+            sum1 += n;
+        }
+
+        for (int n : queue2) {
+            q2.offer(n);
+            sum2 += n;
+        }
+
+        long target = (sum1 + sum2);
+
+        // 총합이 홀수면 불가능
+        if (target % 2 != 0) return -1;
+        target /= 2;
+
+        int count = 0;
+        int limit = (queue1.length + queue2.length) * 3;
+
+        while (count <= limit) {
+            if (sum1 == target) {
+                return count;
+            }
+
+            if (sum1 > target) {
+                int num = q1.poll();
+                q2.offer(num);
+                sum1 -= num;
+            } else {
+                int num = q2.poll();
+                q1.offer(num);
+                sum1 += num;
+            }
+
+            count++;
+        }
+
+        return -1;
+    }
+}

박수진/260716_햄버거 만들기.java

@@ -0,0 +1,32 @@
+import java.util.*;
+
+class Solution {
+    public int solution(int[] ingredient) {
+        List<Integer> stack = new ArrayList<>();
+        int answer = 0;
+
+        for (int ing : ingredient) {
+            stack.add(ing);
+
+            if (stack.size() >= 4) {
+                int size = stack.size();
+
+                if (stack.get(size - 4) == 1 &&
+                    stack.get(size - 3) == 2 &&
+                    stack.get(size - 2) == 3 &&
+                    stack.get(size - 1) == 1) {
+
+                    // 햄버거 제거
+                    stack.remove(size - 1);
+                    stack.remove(size - 2);
+                    stack.remove(size - 3);
+                    stack.remove(size - 4);
+
+                    answer++;
+                }
+            }
+        }
+
+        return answer;
+    }
+}