FilesExpand file tree

 master

/

RodCutting.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

32 lines (26 loc) · 860 Bytes

 master

/

RodCutting.java

Copy path

Top

File metadata and controls

• Code
• Blame

32 lines (26 loc) · 860 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

package DynamicProgramming;

/**

* A DynamicProgramming 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;

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;

}

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));

}

}