Update Solution.java

Author: javadev

src/main/java/g3201_3300/s3213_construct_string_with_minimum_cost/Solution.java

@@ -87,8 +87,8 @@ 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]));
+                    int value = qm.getOrDefault(b, Integer.MAX_VALUE));
+                    qm.put(b, Math.min(value, costs[i]));
                 }
             }
         }