Some new solution

Leet/Java/src/LeetSolutions.java

@@ -35,14 +35,13 @@ public static void main(String[] args) {
     //MaximumSwap x = new MaximumSwap();
     //x.maximumSwap(98368);
 
-    ListNode head =  new ListNode(1);
-    head.next =  new ListNode(2);
-    head.next.next = new ListNode(3);
-    head.next.next.next = new ListNode(4);
-    head.next.next.next.next = new ListNode(5);
+
 
-    ReorderList rl =  new   ReorderList();
+    MagicDictionary md =  new MagicDictionary();
+
+    String[] dict = {"hello","leetcode"};
+    md.buildDict(dict);
+    boolean s = md.search("hhelo");
 
-    rl.reorderList(head);
    }
 }

Leet/Java/src/MagicDictionary.java

@@ -0,0 +1,78 @@
+import java.util.HashMap;
+import java.util.ArrayList;
+
+class MagicDictionary {
+
+    HashMap<String,ArrayList<String>> mdict;
+
+    /** Initialize your data structure here. */
+    public MagicDictionary() {
+        mdict = new HashMap<String,ArrayList<String>>();
+    }
+
+    /** Build a dictionary through a list of words */
+    public void buildDict(String[] dict) {
+
+        for (String str : dict) {
+            String[] strarray =  buildStrArray(str);
+
+            for (String var : strarray) {
+
+                if(mdict.keySet().contains(var))
+                {
+                    ArrayList<String> list = mdict.get(var);
+                    list.add(str);
+                }
+                else
+                {
+                    ArrayList<String> list = new ArrayList<String>();
+                    list.add(str);
+                    mdict.put(var,list);
+                }
+
+            }
+        }
+    }
+
+    /** Returns if there is any word in the trie that equals to the given word after modifying exactly one character */
+    public boolean search(String word) {
+
+        String[] strarray =  buildStrArray(word);
+
+            for (String var : strarray) {
+                if(mdict.keySet().contains(var))
+                {
+
+                    ArrayList<String> list =  mdict.get(var);
+
+
+                    if(list.size() > 1)
+                        return true;
+
+                    if(!list.get(0).equals(word))
+                    return true;
+
+                }
+            }
+
+        return false;
+    }
+
+    public String[] buildStrArray(String str)
+    {
+        char[] array =  str.toCharArray();
+
+        String[] r = new String[array.length];
+
+        for(int i = 0; i<array.length;i++)
+        {
+            char t = array[i];
+            array[i] = '?';
+            r[i] =  new String(array);
+            array[i] = t;
+
+        }
+
+        return r;
+    }
+}

Leet/Java/src/OddEvenLinkedList.java

@@ -0,0 +1,46 @@
+/**
+ * OddEvenLinkedList
+ */
+public class OddEvenLinkedList {
+
+    public ListNode oddEvenList(ListNode head) {
+
+        if(head == null || head.next == null)
+        return head;
+
+        ListNode head2 = head.next;
+
+        ListNode evenListHead = head;
+        ListNode oddListHead = head.next;
+
+
+        while(evenListHead.next != null && oddListHead.next != null)
+        {
+            if(evenListHead.next.next != null)
+            {
+                ListNode Next = evenListHead.next.next;
+                evenListHead.next = Next;
+                evenListHead = Next;
+            }
+            else
+            {
+                evenListHead.next = null;
+            }
+
+            if(oddListHead.next.next != null)
+            {
+                ListNode Next = oddListHead.next.next;
+                oddListHead.next = Next;
+                oddListHead = Next;
+            }
+            else
+            {
+                oddListHead.next = null;
+            }
+        }
+
+        evenListHead.next = head2;
+
+        return head;
+    }
+}