leetcode375.猜数字大小II

区间dp问题

class Solution {public int getMoneyAmount(int n) {int[][] dp = new int[n + 1][n + 1];for (int i = n - 1; i >= 1; i--) {dp[i][i + 1] = i;for (int j = i + 2; j <= n; j++) {dp[i][j] = Integer.MAX_VALUE;for (int k = i + 1; k < j; k++) {dp[i][j] = Math.min(dp[i][j],Math.max(dp[i][k - 1], dp[k + 1][j]) + k);}}}return dp[1][n];}
}