From e7ff5de7ffa5b7656174ea791b68c30c483151c2 Mon Sep 17 00:00:00 2001
From: rl544 <111494264+rl544@users.noreply.github.com>
Date: Sun, 29 Jan 2023 20:03:25 +0900
Subject: [PATCH] =?UTF-8?q?uploaded=20at=202023.=201.=2029.=20=EC=98=A4?=
 =?UTF-8?q?=ED=9B=84=208:03:25?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../택배 배달과 수거하기/solution.java        | 63 +++++++++++++++++++
 1 file changed, 63 insertions(+)
 create mode 100644 programmers/택배 배달과 수거하기/solution.java

diff --git a/programmers/택배 배달과 수거하기/solution.java b/programmers/택배 배달과 수거하기/solution.java
new file mode 100644
index 0000000..49b8dd3
--- /dev/null
+++ b/programmers/택배 배달과 수거하기/solution.java	
@@ -0,0 +1,63 @@
+// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/150369
+
+class Solution {
+    public long solution(int cap, int n, int[] deliveries, int[] pickups) {
+        long answer = 0;
+        int len = n, lm = len-1, lm2 = lm, tmp = 0;
+        while(true){
+            int maxD = 0, maxP = 0, pickCap = 0, delCap = 0, pm = -2, dm = -2;
+            boolean[] full = new boolean[2];
+			for(int x = lm; x>=0; x--){
+                int del = deliveries[x];
+                if(del==0) continue;
+                if(maxD == 0) maxD = x;
+                if(delCap != cap && del!=0){
+                    if(delCap<cap){
+                        if(del > cap - delCap) {
+                            tmp = cap - delCap; //더클때
+                            if(dm<x) dm = x;
+                        }
+                        else if(del == cap - delCap) { //같을때
+                            tmp = del;
+                            if(dm<x) dm = x-1;
+                        }
+                        else {
+                            tmp = del; //작을때
+                        }
+                        deliveries[x] -= tmp;
+                        delCap += tmp;
+                    }
+                }
+                if(delCap == cap) break;
+            }
+			
+            for(int x = lm2; x>=0; x--){
+                int pic = pickups[x];
+                if(pic == 0) continue;
+                if(maxP == 0) maxP = x;
+                if(pickCap != cap && pic!=0){
+                    if(pickCap<cap){
+                        if(pic > cap - pickCap) {
+                            tmp = cap - pickCap; //더클때
+                            if(pm<x) pm = x;
+                        }
+                        else if(pic == cap - pickCap) { //같을때
+                            tmp = pic;
+                            if(pm<x) pm = x-1;
+                        }
+                        else {
+                            tmp = pic; //작을때
+                        }
+                        pickups[x] -= tmp;
+                        pickCap += tmp;
+                    }
+                }
+                if(pickCap == cap) break;
+            }
+            lm = dm; lm2 = pm;
+            if(delCap == 0 && pickCap == delCap) break;
+            answer += 2*(Math.max(maxD,maxP)+1);
+        }
+        return answer;
+    }
+}
\ No newline at end of file