Merge pull request TheAlgorithms#1027 from salonilakhotia/master

yanglbme · web-flow · commit 9fdb1c85f742 · 2019-10-12T14:06:14.000+08:00
Result print
diff --git a/DynamicProgramming/Fibonacci.java b/DynamicProgramming/Fibonacci.java
@@ -16,11 +16,11 @@ public class Fibonacci {
     public static void main(String[] args) throws Exception {
 
         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
-        int n = Integer.parseInt(br.readLine());
+        int size = Integer.parseInt(br.readLine());
 
         // Methods all returning [0, 1, 1, 2, 3, 5, ...] for n = [0, 1, 2, 3, 4, 5, ...]
-        System.out.println(fibMemo(n));
-        System.out.println(fibBotUp(n));
+        System.out.println(fibMemo(size));
+        System.out.println(fibBotUp(size));
     }
 
     /**
diff --git a/DynamicProgramming/RodCutting.java b/DynamicProgramming/RodCutting.java
@@ -26,7 +26,8 @@ private static int cutRod(int[] price, int n) {
     public static void main(String args[]) {
         int[] arr = new int[]{2, 5, 13, 19, 20};
         int size = arr.length;
+	int result = cutRod(arr,size); 
         System.out.println("Maximum Obtainable Value is " +
-                cutRod(arr, size));
+                result);
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -26,7 +26,8 @@ private static int cutRod(int[] price, int n) {`
`26`	`26`	`public static void main(String args[]) {`
`27`	`27`	`int[] arr = new int[]{2, 5, 13, 19, 20};`
`28`	`28`	`int size = arr.length;`
	`29`	`+ int result = cutRod(arr,size);`
`29`	`30`	`System.out.println("Maximum Obtainable Value is " +`
`30`		`- cutRod(arr, size));`
	`31`	`+ result);`
`31`	`32`	`}`
`32`	`33`	`}`