Longest word dictionary

edyluisrey · edyluisrey · commit 6284bb2ce463 · 2019-01-02T22:38:26.000-05:00
diff --git a/src/leetcode/MergeTwoSortedLists.java b/src/leetcode/MergeTwoSortedLists.java
@@ -1,13 +1,13 @@
 package leetcode;
 
-class ListNode {
+/*class ListNode {
     int val;
     ListNode next;
     ListNode(int x) {
    	 val = x;
    	 next=null;
     }
-}
+}*/
 
 public class MergeTwoSortedLists {
 
diff --git a/src/leetcode/NextGreaterElementII.java b/src/leetcode/NextGreaterElementII.java
diff --git a/src/leetcode/SortListTest.java b/src/leetcode/SortListTest.java
@@ -51,10 +51,10 @@ public ListNode merge(ListNode l1, ListNode l2){
 		
 }
 
-class ListNode{
+/*class ListNode{
 	int val;
 	ListNode next;
 	ListNode(int x){
 		val=x;
 	}
-}
+}*/
diff --git a/src/leetcode2018/LongestWordDictionary.java b/src/leetcode2018/LongestWordDictionary.java
@@ -0,0 +1,71 @@
+package leetcode2018;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class LongestWordDictionary {
+	public String longestWord(String[] words) {
+	    TrieNode root = new TrieNode('0');
+	    Result re = new Result("");
+	    for(String word: words)
+	        insert(word, root);
+	    dfs(root, re);     
+	    return re.val;    
+	}
+	
+	public void dfs(TrieNode root, Result re){ 
+	    if(root.isComplete && re.length < root.word.length()){
+	        re.val = root.word;
+	        re.length=root.word.length();
+	    }
+	    if(root.isComplete && root.word.length() == re.length && root.word.compareTo(re.val)<0){
+	        re.val = root.word;
+	        re.length=root.word.length();
+	    }
+	    for(char c: root.children.keySet()){
+	       if(root.children.get(c).isComplete) 
+	         dfs(root.children.get(c), re);       
+	    }
+	}
+	
+	public void insert(String word, TrieNode root){
+	    TrieNode currentRoot = root;
+	    int i =0;
+	    for(char c: word.toCharArray()){
+	        if(!currentRoot.children.containsKey(c)){
+	            TrieNode node = new TrieNode(c);
+	            currentRoot.children.putIfAbsent(c, node);
+	        }
+	        
+	        currentRoot = currentRoot.children.get(c);
+	        i++;
+	        if(word.length()==i){
+	           currentRoot.isComplete = true;
+	           currentRoot.word = word; 
+	        }
+	        
+	    }
+	}
+	
+	class Result{
+	   String val;
+	   int length; 
+	   Result(String val){
+	      this.val= val; 
+	      this.length=0; 
+	   } 
+	}
+	
+	class TrieNode {
+	    Character val;
+	    Map<Character, TrieNode> children;
+	    String word;
+	    boolean isComplete;
+	    TrieNode(Character val){
+	        this.val = val;
+	        this.children = new HashMap<>();
+	        this.word = "";
+	        this.isComplete = false;
+	    }
+	}
+}

Original file line number	Diff line number	Diff line change
`@@ -51,10 +51,10 @@ public ListNode merge(ListNode l1, ListNode l2){`
`51`	`51`
`52`	`52`	`}`
`53`	`53`
`54`		`-class ListNode{`
	`54`	`+/*class ListNode{`
`55`	`55`	`int val;`
`56`	`56`	`ListNode next;`
`57`	`57`	`ListNode(int x){`
`58`	`58`	`val=x;`
`59`	`59`	`}`
`60`		`-}`
	`60`	`+}*/`