Fixed sonar

javadev · javadev · commit 7c5f710f801c · 2024-07-14T06:38:29.000+03:00
diff --git a/src/main/java/g3201_3300/s3213_construct_string_with_minimum_cost/Solution.java b/src/main/java/g3201_3300/s3213_construct_string_with_minimum_cost/Solution.java
@@ -87,8 +87,11 @@ public int minimumCost(String target, String[] words, int[] costs) {
                     int e = pair.get(1);
                     dm.putIfAbsent(e, new HashMap<>());
                     Map<Integer, Integer> qm = dm.get(e);
-                    qm.put(b, qm.getOrDefault(b, Integer.MAX_VALUE));
-                    qm.put(b, Math.min(qm.get(b), costs[i]));
+                    if (qm.containsKey(b)) {
+                        qm.put(b, Math.min(qm.get(b), costs[i]));
+                    } else {
+                        qm.put(b, costs[i]);
+                    }
                 }
             }
         }

Original file line number	Diff line number	Diff line change
`@@ -87,8 +87,11 @@ public int minimumCost(String target, String[] words, int[] costs) {`
`87`	`87`	`int e = pair.get(1);`
`88`	`88`	`dm.putIfAbsent(e, new HashMap<>());`
`89`	`89`	`Map<Integer, Integer> qm = dm.get(e);`
`90`		`- qm.put(b, qm.getOrDefault(b, Integer.MAX_VALUE));`
`91`		`- qm.put(b, Math.min(qm.get(b), costs[i]));`
	`90`	`+ if (qm.containsKey(b)) {`
	`91`	`+ qm.put(b, Math.min(qm.get(b), costs[i]));`
	`92`	`+ } else {`
	`93`	`+ qm.put(b, costs[i]);`
	`94`	`+ }`
`92`	`95`	`}`
`93`	`96`	`}`
`94`	`97`	`}`