Commit 1a421f8

committed

Changes

1 parent ac8dfa9 commit 1a421f8Copy full SHA for 1a421f8

File tree

-9

lines changed

-9

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -26,7 +26,7 @@ public static void main(String[] args) {`
`26`	`26`	`int n = sc.nextInt();`
`27`	`27`	`int ans = solution(n);`
`28`	`28`	`System.out.println(ans);`
`29`		`- // sc.close();`
	`29`	`+ sc.close();`
`30`	`30`
`31`	`31`	`}`
`32`	`32`

Lines changed: 0 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -3,8 +3,6 @@`
`3`	`3`	`//we given an array jumps where jump[i] represents from ith step we can go to i+jumps[i] ith steps;`
`4`	`4`	`//we have to start from 0th step and reach the nth step using jumps`
`5`	`5`
`6`		`-import java.util.Scanner;`
`7`		`-`
`8`	`6`	`public class ClimbStairs2 {`
`9`	`7`	`public static int getNoOfWays(int n, int[] jumps) {`
`10`	`8`	`int[] dp = new int[n + 1];`
`@@ -20,7 +18,6 @@ public static int getNoOfWays(int n, int[] jumps) {`
`20`	`18`	`}`
`21`	`19`
`22`	`20`	`public static void main(String[] args) {`
`23`		`- Scanner sc = new Scanner(System.in);`
`24`	`21`	`int n = 6; // number of steps;`
`25`	`22`	`int[] jumps = { 2, 3, 0, 1, 2, 3 };`
`26`	`23`	`int ans = getNoOfWays(n, jumps);`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -21,7 +21,6 @@ public static int getNoOfWays(int n, int[] jumps) {`
`21`	`21`	`}`
`22`	`22`
`23`	`23`	`public static void main(String[] args) {`
`24`		`- Scanner sc = new Scanner(System.in);`
`25`	`24`	`int n = 6; // number of steps;`
`26`	`25`	`int[] jumps = { 2, 3, 0, 1, 2, 3 };`
`27`	`26`	`int ans = getNoOfWays(n, jumps);`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`	`1`	`public class BoundedKnapSack {`
`2`		`- public static int Solve(int W, int N, int[] val, int[] wt) {`
	`2`	`+ public static int solve(int W, int N, int[] val, int[] wt) {`
`3`	`3`	`int[][] dp = new int[N + 1][W + 1];`
`4`	`4`	`// dp[i][j] represents max value achieved with sack of capacity j and i-1 items;`
`5`	`5`	`for (int i = 1; i <= N; i++) {`
`@@ -23,7 +23,7 @@ public static void main(String[] args) {`
`23`	`23`	`int[] val = { 1, 2, 3 }; // values of items;`
`24`	`24`	`int[] wt = { 3, 5, 1 }; // weights of items`
`25`	`25`
`26`		`- int ans = Solve(W, N, val, wt);`
	`26`	`+ int ans = solve(W, N, val, wt);`
`27`	`27`	`System.out.println(ans);`
`28`	`28`	`}`
`29`	`29`	`}`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`	`//this problem is quite similar to coinChange2`
`3`	`3`
`4`	`4`	`public class UnboundedKS {`
`5`		`- public static int Solve(int W, int N, int[] val, int[] wt) {`
	`5`	`+ public static int solve(int W, int N, int[] val, int[] wt) {`
`6`	`6`	`int[] dp = new int[W + 1];`
`7`	`7`	`// dp[i] represents max Value achieved with sack of capacity of i`
`8`	`8`	`for (int i = 0; i <= W; i++) {`
`@@ -22,7 +22,7 @@ public static void main(String[] args) {`
`22`	`22`	`int N = 3; // No of items`
`23`	`23`	`int[] val = { 1, 2, 3 }; // values of items;`
`24`	`24`	`int[] wt = { 3, 5, 1 }; // weights of items`
`25`		`- int ans = Solve(W, N, val, wt);`
	`25`	`+ int ans = solve(W, N, val, wt);`
`26`	`26`	`System.out.println(ans);`
`27`	`27`	`}`
`28`	`28`	`}`

Comments

(0)