From 85aa51034dea269150c34ce152c5387be1e48b76 Mon Sep 17 00:00:00 2001 From: zzu <90972641+Zuhye@users.noreply.github.com> Date: Thu, 5 Nov 2026 22:49:38 +0900 Subject: [PATCH] 3857. Minimum Cost to Split into Ones Implement dynamic programming solution to calculate minimum cost to split an integer into ones. --- .../3857. Minimum Cost to Split into Ones" | 15 +++++++++++++++ 1 file changed, 15 insertions(+) create mode 100644 "leetcode3/\354\206\241\354\243\274\355\230\234/3857. Minimum Cost to Split into Ones" diff --git "a/leetcode3/\354\206\241\354\243\274\355\230\234/3857. Minimum Cost to Split into Ones" "b/leetcode3/\354\206\241\354\243\274\355\230\234/3857. Minimum Cost to Split into Ones" new file mode 100644 index 00000000..0af5d409 --- /dev/null +++ "b/leetcode3/\354\206\241\354\243\274\355\230\234/3857. Minimum Cost to Split into Ones" @@ -0,0 +1,15 @@ +class Solution: + def minCost(self, n: int) -> int: + dp = [0] * (n+1) + + for i in range(2, n+1): + max_v = 1e9 + + for j in range(1, i): + cost = j*(i-j) + dp[j] + dp[i-j] + + if cost < max_v: + max_v = cost + + dp[i] = max_v + return dp[n]