1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
|
public class {
public int getMoneyAmount(int n) { int[][] dp = new int[n+1][n+1]; int ans = Integer.MAX_VALUE; return helper(dp, 1, n); }
public int helper(int[][] dp, int left, int right){ if (dp[left][right] != 0) return dp[left][right]; if (left >= right) return 0; int min = Integer.MAX_VALUE; for (int i=left; i<=right; i++){ int temp = i + Math.max(helper(dp, left, i-1), helper(dp, i+1, right)); min = Math.min(temp, min); } dp[left][right] = min; return min; } public static void main(String[] args){ } }
|
近期评论