Update Solution.java

javadev · web-flow · commit fe140671ee1c · 2024-05-15T09:40:56.000+03:00
diff --git a/src/main/java/g3101_3200/s3149_find_the_minimum_cost_array_permutation/Solution.java b/src/main/java/g3101_3200/s3149_find_the_minimum_cost_array_permutation/Solution.java
@@ -24,7 +24,8 @@ private int findMinScore(int mask, int prevNum, int[] nums, int[][] dp) {
                 minScore = Math.min(minScore, currScore);
             }
         }
-        return dp[mask][prevNum] = minScore;
+        dp[mask][prevNum] = minScore;
+        return dp[mask][prevNum];
     }
 
     private int[] constructMinScorePermutation(int n, int[] nums, int[][] dp) {

Original file line number	Diff line number	Diff line change
`@@ -24,7 +24,8 @@ private int findMinScore(int mask, int prevNum, int[] nums, int[][] dp) {`
`24`	`24`	`minScore = Math.min(minScore, currScore);`
`25`	`25`	`}`
`26`	`26`	`}`
`27`		`- return dp[mask][prevNum] = minScore;`
	`27`	`+ dp[mask][prevNum] = minScore;`
	`28`	`+ return dp[mask][prevNum];`
`28`	`29`	`}`
`29`	`30`
`30`	`31`	`private int[] constructMinScorePermutation(int n, int[] nums, int[][] dp) {`