From c8ff9bff7fa568623406ffe154e9837dfc3640a1 Mon Sep 17 00:00:00 2001
From: 724thomas <724thomas@gmail.com>
Date: Thu, 26 Jun 2025 10:27:12 +0900
Subject: [PATCH 1/2] =?UTF-8?q?[=EC=B5=9C=EC=9B=90=EC=A4=80]Day24?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../Q2735.java"                               | 35 +++++++++++++++++++
 1 file changed, 35 insertions(+)
 create mode 100644 "leetcode2/2medium/\354\265\234\354\233\220\354\244\200/Q2735.java"

diff --git "a/leetcode2/2medium/\354\265\234\354\233\220\354\244\200/Q2735.java" "b/leetcode2/2medium/\354\265\234\354\233\220\354\244\200/Q2735.java"
new file mode 100644
index 00000000..1eae7023
--- /dev/null
+++ "b/leetcode2/2medium/\354\265\234\354\233\220\354\244\200/Q2735.java"
@@ -0,0 +1,35 @@
+package Leetcode.최원준;
+
+/*
+1. 아이디어 :
+
+
+2. 시간복잡도 :
+O( )
+
+3. 자료구조/알고리즘 :
+
+ */
+
+public class Q2735 {
+    class Solution {
+        public long minCost(int[] nums, int x) {
+            int n = nums.length;
+            long[] totalCost = new long[n];
+            int[] minVals = nums.clone();
+            long ans = Long.MAX_VALUE;
+
+            for (int change = 0; change < n; change++) {
+                for (int i=0; i<n; i++) {
+                    int idx = (i + change) % n;
+                    minVals[i] = Math.min(minVals[i], nums[idx]);
+                    totalCost[change] += minVals[i];
+                }
+                totalCost[change] += (long)change * x;
+                ans = Math.min(ans, totalCost[change]);
+            }
+            return ans;
+        }
+    }
+
+}

From 4a4838a611f367ce63e8cfa7568bf4f4155d077f Mon Sep 17 00:00:00 2001
From: 724thomas <724thomas@gmail.com>
Date: Thu, 26 Jun 2025 10:29:12 +0900
Subject: [PATCH 2/2] =?UTF-8?q?[=EC=B5=9C=EC=9B=90=EC=A4=80]Day24?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../\354\265\234\354\233\220\354\244\200/Q2735.java"     | 9 ++++-----
 1 file changed, 4 insertions(+), 5 deletions(-)

diff --git "a/leetcode2/2medium/\354\265\234\354\233\220\354\244\200/Q2735.java" "b/leetcode2/2medium/\354\265\234\354\233\220\354\244\200/Q2735.java"
index 1eae7023..2f3d7654 100644
--- "a/leetcode2/2medium/\354\265\234\354\233\220\354\244\200/Q2735.java"
+++ "b/leetcode2/2medium/\354\265\234\354\233\220\354\244\200/Q2735.java"
@@ -15,21 +15,20 @@ public class Q2735 {
     class Solution {
         public long minCost(int[] nums, int x) {
             int n = nums.length;
-            long[] totalCost = new long[n];
             int[] minVals = nums.clone();
             long ans = Long.MAX_VALUE;
 
             for (int change = 0; change < n; change++) {
+                long totalCost = 0;
                 for (int i=0; i<n; i++) {
                     int idx = (i + change) % n;
                     minVals[i] = Math.min(minVals[i], nums[idx]);
-                    totalCost[change] += minVals[i];
+                    totalCost += minVals[i];
                 }
-                totalCost[change] += (long)change * x;
-                ans = Math.min(ans, totalCost[change]);
+                totalCost += (long)change * x;
+                ans = Math.min(ans, totalCost);
             }
             return ans;
         }
     }
-
 }