GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Java/DynamicProgramming/RodCutting.java at master · foresightyj/Java Expand file tree/ Copy pathRodCutting.javaMore file actions 29 lines (23 loc) · 770 Bytes / Copy pathRodCutting.javaFile metadata and controls29 lines (23 loc) · 770 Bytes 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 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 result = cutRod(arr, arr.length); System.out.println("Maximum Obtainable Value is " + result); } } |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |