From 5002785ca1ae9518ece522dd843f71cc7682d387 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EC=A7=80=EC=84=A0=EC=95=84?= <jisuna314@gmail.com>
Date: Sun, 22 Dec 2024 14:59:00 +0900
Subject: [PATCH] =?UTF-8?q?Add=20#7=20=EC=82=AC=EC=B9=99=EC=97=B0=EC=82=B0?=
 =?UTF-8?q?=20-=20=EC=A7=80=EC=84=A0=EC=95=84?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...\354\247\200\354\204\240\354\225\204.java" | 49 +++++++++++++++++++
 1 file changed, 49 insertions(+)
 create mode 100644 "dp/\354\202\254\354\271\231\354\227\260\354\202\260/\354\247\200\354\204\240\354\225\204.java"

diff --git "a/dp/\354\202\254\354\271\231\354\227\260\354\202\260/\354\247\200\354\204\240\354\225\204.java" "b/dp/\354\202\254\354\271\231\354\227\260\354\202\260/\354\247\200\354\204\240\354\225\204.java"
new file mode 100644
index 0000000..c165c35
--- /dev/null
+++ "b/dp/\354\202\254\354\271\231\354\227\260\354\202\260/\354\247\200\354\204\240\354\225\204.java"
@@ -0,0 +1,49 @@
+import java.util.*; 
+
+class Solution {
+    public int solution(String arr[]) {
+        int n = (arr.length + 1) / 2;
+        int[] numbers = new int[n];
+        char[] operators = new char[n -1];
+
+        // 숫자 연산자 분리
+        for (int i = 0; i < arr.length; i++) {
+            if (i % 2 == 0) {
+                numbers[i / 2] = Integer.parseInt(arr[i]);
+            } else {
+                operators[i / 2] = arr[i].charAt(0);
+            }
+        }
+
+        // maxDP[i][j] : 구간 i ~ j의 최대값
+        // minDP[i][j] : 구간 i ~ j의 최솟값
+        // dp 테이블 초기화
+        int[][] maxDP = new int[n][n];
+        int[][] minDP = new int[n][n];
+        for (int[] row : maxDP) Arrays.fill(row, Integer.MIN_VALUE);
+        for (int[] row : minDP) Arrays.fill(row, Integer.MAX_VALUE);
+
+        // 길이 1인 구간 초기화
+        for (int i = 0; i < n; i++) {
+            maxDP[i][i] = numbers[i];
+            minDP[i][i] = numbers[i];
+        }
+        // 길이 2 이상인 구간 계산
+        for (int len = 1; len < n; len++) {
+            for (int i = 0; i < n - len; i++) { // 시작 인덱스
+                int j = i + len; // 끝 인덱스
+                for (int k = i; k < j; k++) { // 중간 연산자 (i -> k -> j)
+                    char op = operators[k];
+                    if (op == '+') {
+                        maxDP[i][j] = Math.max(maxDP[i][j], maxDP[i][k] + maxDP[k+1][j]);
+                        minDP[i][j] = Math.min(minDP[i][j], minDP[i][k] + minDP[k+1][j]);
+                    } else if (op == '-') {
+                        maxDP[i][j] = Math.max(maxDP[i][j], maxDP[i][k] - minDP[k+1][j]);
+                        minDP[i][j] = Math.min(minDP[i][j], minDP[i][k] - maxDP[k+1][j]);
+                    }
+                }
+            }
+        }
+        return maxDP[0][n - 1];
+    }
+}