update

Author: ThanhNIT

src/main/java/g0101_0200/s0139_word_break/Solution.java

@@ -24,11 +24,7 @@ public boolean dp(String s, int i, List<String> wordDict) {
         }
         for (String word : wordDict) {
             int len = word.length();
-            if (i + len > s.length()) {
-                continue;
-            }
-            String subStr = s.substring(i, i + len);
-            if (!subStr.equals(word)) {
+            if (i + len > s.length() || !s.substring(i, i + len).equals(word)) {
                 continue;
             }
             if (dp(s, i + len, wordDict)) {

src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java

@@ -12,8 +12,6 @@ public class Trie {
     private boolean ans = false;
     private final TrieNode[] trees = new TrieNode[26];
 
-    public Trie() {}
-
     TrieNode mapWordToTree(TrieNode t, String word, int i) {
         char m = word.charAt(i);
         boolean found = false;