Added Maximum Sum of Non-Adjacent Elements Algorithm

HemanthTigga · HemanthTigga · commit 4d90d58ea43e · 2024-10-02T18:03:52.000+05:30
diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/MaxSumNonAdjacent.java b/src/main/java/com/thealgorithms/dynamicprogramming/MaxSumNonAdjacent.java
@@ -37,8 +37,7 @@ static int solveUtil(int index, int[] arr, int[] dp) {
 
     static int solve(int n, int[] arr) {
         int[] dp = new int[n];
-
-        Arrays.fill(dp, -1);
+        for (int i = 0; i < n; i++) dp[i] = -1;
 
         return solveUtil(n - 1, arr, dp);
     }

Original file line number	Diff line number	Diff line change
`@@ -37,8 +37,7 @@ static int solveUtil(int index, int[] arr, int[] dp) {`
`37`	`37`
`38`	`38`	`static int solve(int n, int[] arr) {`
`39`	`39`	`int[] dp = new int[n];`
`40`		`-`
`41`		`- Arrays.fill(dp, -1);`
	`40`	`+ for (int i = 0; i < n; i++) dp[i] = -1;`
`42`	`41`
`43`	`42`	`return solveUtil(n - 1, arr, dp);`
`44`	`43`	`}`