Improved task

Author: javadev

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

@@ -86,9 +86,7 @@ public int minimumCost(String target, String[] words, int[] costs) {
         dp[0] = 0;
         ACAutomaton.Node node = root;
         for (int i = 1; i < dp.length; i++) {
-            if (node != null) {
-                node = ac.go(node, target.charAt(i - 1));
-            }
+            node = ac.go(node, target.charAt(i - 1));
             for (ACAutomaton.Node temp = node;
                     temp != null && temp != root;
                     temp = ac.getOutput(temp)) {