docs(DP): update RodCutting.java
This commit is contained in:
parent
6ff87322e6
commit
5ec25c1670
@ -1,19 +1,19 @@
|
|||||||
/* A Dynamic Programming solution for Rod cutting problem
|
/**
|
||||||
Returns the best obtainable price for a rod of
|
* A Dynamic Programming solution for Rod cutting problem
|
||||||
length n and price[] as prices of different pieces */
|
* Returns the best obtainable price for a rod of
|
||||||
|
* length n and price[] as prices of different pieces
|
||||||
|
*
|
||||||
|
*/
|
||||||
public class RodCutting {
|
public class RodCutting {
|
||||||
|
|
||||||
private static int cutRod(int price[],int n)
|
private static int cutRod(int[] price, int n) {
|
||||||
{
|
int val[] = new int[n + 1];
|
||||||
int val[] = new int[n+1];
|
|
||||||
val[0] = 0;
|
val[0] = 0;
|
||||||
|
|
||||||
for (int i = 1; i<=n; i++)
|
for (int i = 1; i <= n; i++) {
|
||||||
{
|
|
||||||
int max_val = Integer.MIN_VALUE;
|
int max_val = Integer.MIN_VALUE;
|
||||||
for (int j = 0; j < i; j++)
|
for (int j = 0; j < i; j++)
|
||||||
max_val = Math.max(max_val,price[j] + val[i-j-1]);
|
max_val = Math.max(max_val, price[j] + val[i - j - 1]);
|
||||||
|
|
||||||
val[i] = max_val;
|
val[i] = max_val;
|
||||||
}
|
}
|
||||||
@ -21,10 +21,9 @@ public class RodCutting {
|
|||||||
return val[n];
|
return val[n];
|
||||||
}
|
}
|
||||||
|
|
||||||
//main function to test
|
// main function to test
|
||||||
public static void main(String args[])
|
public static void main(String args[]) {
|
||||||
{
|
int[] arr = new int[]{2, 5, 13, 19, 20};
|
||||||
int arr[] = new int[] {2, 5, 13, 19, 20};
|
|
||||||
int size = arr.length;
|
int size = arr.length;
|
||||||
System.out.println("Maximum Obtainable Value is " +
|
System.out.println("Maximum Obtainable Value is " +
|
||||||
cutRod(arr, size));
|
cutRod(arr, size));
|
||||||
|
Loading…
Reference in New Issue
Block a user