375. Guess Number Higher or Lower II
来源:互联网 发布:美工图片 编辑:程序博客网 时间:2024/06/01 03:58
这是一道涉及动态规划算法的题,算法思想:dp[i][j] = min (i<=k<=j) { k + max(dp[i][k-1], dp[k+1][j]) 。
实现步骤,先对j进行从小到大的递加循环,在对i从j-1到1的递减循环。
如[1][2]; [2][3],[1][3]; [3][4],[2][4],[1][4]; ........
对n返回dp[1][n]即可。
public class Solution {
public int getMoneyAmount(int n) {
if(n==1) return 0;
int[][] dp = new int[n+1][n+1];
for(int j=2;j<n+1;j++){
for(int i=j-1;i>0;i--){
dp[i][j] = Integer.MAX_VALUE;
for (int k = i; k <= j; k++) {
dp[i][j] = Math.min(dp[i][j],k + Math.max(k - 1 >= i ? dp[i][k - 1] : 0,
j >= k + 1 ? dp[k + 1][j] : 0));
}
}
}
return dp[1][n];
}
}
0 0
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II**
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 375. Guess Number Higher or Lower II
- 【UVALive】2037 - Digital Rivers(找规律,暴力)
- Windows下 tuxedo 安装及测试
- 动态规划(4)交替字符串
- C++ vector 实现
- hdu 5175 Misaki's Kiss again(数论)
- 375. Guess Number Higher or Lower II
- scrapy抓取动态页面方法
- windows中运行qt5构建的程序提示 无法启动此程序,因为计算机中丢失qt5Cored.dll 解决方法
- MySQL 模糊查询
- AssistiveTouch热键按钮
- 分水岭算法分割图像的原理概述及OpenCV代码实现
- Vector Drawable(矢量图形)和黑夜白昼主题的设置
- Java使用swing时使用本地系统外观
- ClassNotFoundException:"com.android.tools.fd.runtime.BootstrapApplication"