Create Minimum Cost to Reach Every Position.java

varunu28 · web-flow · commit 6c82d5e37dfb · 2025-03-30T07:15:26.000-07:00
diff --git a/Easy/Minimum Cost to Reach Every Position.java b/Easy/Minimum Cost to Reach Every Position.java
@@ -0,0 +1,13 @@
+class Solution {
+    public int[] minCosts(int[] cost) {
+        int n = cost.length;
+        int[] result = new int[n];
+        int minCost = Integer.MAX_VALUE;
+        for (int i = 0; i < n; i++) {
+            int curr = cost[i];
+            minCost = Math.min(minCost, curr);
+            result[i] = minCost;
+        }
+        return result;
+    }
+}
