We are playing the Guess Game. The game is as follows:
I pick a number from 1 to n. You have to guess which number I picked.
Every time you guess wrong, I'll tell you whether the number I picked is higher or lower.
However, when you guess a particular number x, and you guess wrong, you pay $x. You win the game when you guess the number I picked.
Example:
n = 10, I pick 8.
First round: You guess 5, I tell you that it's higher. You pay $5.
Second round: You guess 7, I tell you that it's higher. You pay $7.
Third round: You guess 9, I tell you that it's lower. You pay $9.
Game over. 8 is the number I picked.
You end up paying $5 + $7 + $9 = $21.
Given a particular n ≥ 1, find out how much money you need to have to guarantee a win.
分析:动态规划 money[i][j]=min(max(money[i][k-1],money[k+1][j])+k) i<k<j
先初始化money[i][i+1]=i
public class Solution {
public int getMoneyAmount(int n) {
int[][] money = new int[n+1][n+1];
for(int i=1;i<n;i++){
money[i][i+1]=i;
}
int temp;
for(int i=2;i<n;i++){
for(int j=1;j<=n-i;j++){
for(int k=j+1;k<(j+i);k++){
temp=money[j][k-1]>money[k+1][j+i]?money[j][k-1]:money[k+1][j+i];
temp=temp+k;
if(money[j][j+i]==0)
money[j][j+i]=temp;
if(temp<money[j][j+i])
money[j][j+i]=temp;
}
}
}
return money[1][n];
}
}