edit 390

fishercoder1534 · fishercoder1534 · commit 1ada2709b11a · 2017-07-25T11:34:44.000-07:00
diff --git a/README.md b/README.md
@@ -208,7 +208,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |396|[Rotate Function](https://leetcode.com/problems/rotate-function/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_396.java)| O(n^2) could be optimized to O(n) | O(1) | Easy|
 |393|[UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_393.java)| O(?)|O(?) | Medium| Bit Manipulation
 |392|[Is Subsequence](https://leetcode.com/problems/is-subsequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_392.java)| O(m*n)|O(1) | Medium| Array, String
-|390|[Elimination Game](https://leetcode.com/problems/elimination-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/EliminationGame.java)| O(logn)|O(1) | Medium|
+|390|[Elimination Game](https://leetcode.com/problems/elimination-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_390.java)| O(logn)|O(1) | Medium|
 |389|[Find the Difference](https://leetcode.com/problems/find-the-difference/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_389.java)| O(n)|O(1) | Easy|
 |388|[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/)|[Solution](../master/src/main/java/com/fishercoder/solutions/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](../master/src/main/java/com/fishercoder/solutions/_387.java)| O(n)|O(n) | Easy| HashMap
diff --git a/src/main/java/com/fishercoder/solutions/_390.java b/src/main/java/com/fishercoder/solutions/_390.java
@@ -3,13 +3,13 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**There is a list of sorted integers from 1 to n. Starting from left to right, remove the first number and every other number afterward until you reach the end of the list.
-
- Repeat the previous step again, but this time from right to left, remove the right most number and every other number from the remaining numbers.
-
- We keep repeating the steps again, alternating left to right and right to left, until a single number remains.
-
- Find the last number that remains starting with a list of length n.
+/**There is a list of sorted integers from 1 to n.
+ * Starting from left to right,
+ * remove the first number and every other number afterward until you reach the end of the list.
+ * Repeat the previous step again, but this time from right to left,
+ * remove the right most number and every other number from the remaining numbers.
+ * We keep repeating the steps again, alternating left to right and right to left, until a single number remains.
+ * Find the last number that remains starting with a list of length n.
 
  Example:
 
@@ -21,8 +21,10 @@
  6
 
  Output:
- 6*/
-public class EliminationGame {
+ 6
+
+ */
+public class _390 {
     
     //then I turned to Discuss and found this post: https://discuss.leetcode.com/topic/55870/share-my-solutions-for-contest-2
     //instead of literally removing half of the elements in each scan, this solution is just moving the pointer to point to next start position
