Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

docs(DP): update RodCutting.java

Browse Source
This commit is contained in:
Libin Yang 2019-02-23 21:12:08 +08:00 committed by GitHub
parent 6ff87322e6
commit 5ec25c1670
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 26 additions and 27 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

49
Dynamic Programming/RodCutting.java
View File

@ -1,32 +1,31 @@
/* A Dynamic Programming solution for Rod cutting problem
Returns the best obtainable price for a rod of
length n and price[] as prices of different pieces */
/**
* A Dynamic Programming solution for Rod cutting problem
* Returns the best obtainable price for a rod of
* length n and price[] as prices of different pieces
*
*/
public class RodCutting {
private static int cutRod(int price[],int n)
{
int val[] = new int[n+1];
val[0] = 0;
private static int cutRod(int[] price, int n) {
int val[] = new int[n + 1];
val[0] = 0;
for (int i = 1; i<=n; i++)
{
int max_val = Integer.MIN_VALUE;
for (int j = 0; j < i; j++)
max_val = Math.max(max_val,price[j] + val[i-j-1]);
for (int i = 1; i <= n; i++) {
int max_val = Integer.MIN_VALUE;
for (int j = 0; j < i; j++)
max_val = Math.max(max_val, price[j] + val[i - j - 1]);
val[i] = max_val;
}
val[i] = max_val;
}
return val[n];
}
return val[n];
}
//main function to test
public static void main(String args[])
{
int arr[] = new int[] {2, 5, 13, 19, 20};
int size = arr.length;
System.out.println("Maximum Obtainable Value is " +
cutRod(arr, size));
}
// main function to test
public static void main(String args[]) {
int[] arr = new int[]{2, 5, 13, 19, 20};
int size = arr.length;
System.out.println("Maximum Obtainable Value is " +
cutRod(arr, size));
}
}