Updated 2 solutions

kowshikb · Jul 25, 2019 · df63989 · df63989
1 parent f2b9e39
commit df63989
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 28 deletions.
diff --git a/Cracking the Coding Interview/Data Structures/Tries - Contacts/Solution.java b/Cracking the Coding Interview/Data Structures/Tries - Contacts/Solution.java
@@ -38,19 +38,10 @@ public TrieNode getChild(char ch) {
 
 class Trie {
     TrieNode root = new TrieNode();
-
-    Trie(){} // default constructor
-
-    Trie(String[] words) {
-        for (String word : words) {
-            add(word);
-        }
-    }
 
     public void add(String str) {
         TrieNode curr = root;
-        for (int i = 0; i < str.length(); i++) {
-            Character ch = str.charAt(i);
+        for (char ch : str.toCharArray()) {
             curr.putChildIfAbsent(ch);
             curr = curr.getChild(ch);
             curr.size++;
@@ -59,10 +50,7 @@ public void add(String str) {
 
     public int find(String prefix) {
         TrieNode curr = root;
-
-        /* Traverse down tree to end of our prefix */
-        for (int i = 0; i < prefix.length(); i++) {
-            Character ch = prefix.charAt(i);
+        for (char ch : prefix.toCharArray()) {
             curr = curr.getChild(ch);
             if (curr == null) {
                 return 0;

diff --git a/Data Structures/Trie/Contacts/Solution.java b/Data Structures/Trie/Contacts/Solution.java
@@ -38,19 +38,10 @@ public TrieNode getChild(char ch) {
 
 class Trie {
     TrieNode root = new TrieNode();
-
-    Trie(){} // default constructor
-
-    Trie(String[] words) {
-        for (String word : words) {
-            add(word);
-        }
-    }
 
     public void add(String str) {
         TrieNode curr = root;
-        for (int i = 0; i < str.length(); i++) {
-            Character ch = str.charAt(i);
+        for (char ch : str.toCharArray()) {
             curr.putChildIfAbsent(ch);
             curr = curr.getChild(ch);
             curr.size++;
@@ -59,10 +50,7 @@ public void add(String str) {
 
     public int find(String prefix) {
         TrieNode curr = root;
-
-        /* Traverse down tree to end of our prefix */
-        for (int i = 0; i < prefix.length(); i++) {
-            Character ch = prefix.charAt(i);
+        for (char ch : prefix.toCharArray()) {
             curr = curr.getChild(ch);
             if (curr == null) {
                 return 0;