move solutions from Contest package away

fishercoder1534 · fishercoder1534 · commit 095b823f40f4 · 2016-10-10T08:22:12.000-07:00
diff --git a/Contest/src/_20160820_1st_contest/FirstUniqChar.java b/Contest/src/_20160820_1st_contest/FirstUniqChar.java
diff --git a/MEDIUM/src/medium/LexicographicalNumbers.java b/MEDIUM/src/medium/LexicographicalNumbers.java
@@ -1,13 +1,7 @@
-package _20160820_1st_contest;
+package medium;
 
-import java.io.PrintWriter;
-import java.util.ArrayList;
-import java.util.Collections;
-import java.util.Comparator;
-import java.util.Date;
-import java.util.List;
+import java.util.*;
 
-import utils.CommonUtils;
 /**
  * Given an integer n, return 1 - n in lexicographical order.
 
diff --git a/MEDIUM/src/medium/LongestAbsoluteFilePath.java b/MEDIUM/src/medium/LongestAbsoluteFilePath.java
@@ -1,9 +1,9 @@
-package _20160820_1st_contest;
-
-import java.util.Stack;
+package medium;
 
 import utils.CommonUtils;
 
+import java.util.Stack;
+
 public class LongestAbsoluteFilePath {
     public static int lengthLongestPath(String input) {
         Stack<Integer> stack = new Stack();
diff --git a/README.md b/README.md
@@ -2,6 +2,9 @@
 |  #  |      Title     |   Solutions   | Time          | Space         | Difficulty  | Tag          | Notes
 |-----|----------------|---------------|---------------|---------------|-------------|--------------|-----
 |415|[Add Strings](https://leetcode.com/problems/add-strings/)|[Solution](../../blob/master/EASY/src/easy/AddStrings.java)| O(n)|O(1) | Easy|
+|388|[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/)|[Solution](../../blob/master/MEDIUM/src/medium/LongestAbsoluteFilePath.java)| O(n)|O(d) | Medium| Stack
+|387|[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)|[Solution](../../blob/master/EASY/src/easy/FirstUniqueCharacterinaString.java)| O(n)|O(n) | Easy| HashMap
+|386|[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/)|[Solution](../../blob/master/MEDIUM/src/medium/LexicographicalNumbers.java)| O(n)|O(1) | Medium| 
 |350|[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)|[Solution](../../blob/master/EASY/src/easy/IntersectionOfTwoArraysII.java)| O(m+n)|O((m+n)) could be optimized | Easy| HashMap, Binary Search
 |349|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)|[Solution](../../blob/master/EASY/src/easy/IntersectionOfTwoArrays.java)| O(m+n)|O(min(m,n)) | Easy| Two Pointers, Binary Search
 |325|[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/)|[Solution] | O(n)|O(n) | Medium| HashMap
