edit 260

fishercoder1534 · fishercoder1534 · commit e0380491637a · 2017-07-21T07:24:57.000-07:00
diff --git a/README.md b/README.md
@@ -319,6 +319,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |264|[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_264.java)| O(n)|O(n) | Medium| DP
 |263|[Ugly Number](https://leetcode.com/problems/ugly-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_263.java)| O(n)|O(1) | Easy|
 |261|[Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/GraphValidTree.java)| O(V+E)|O(V+E) | Medium|
+|260|[Single Number III](https://leetcode.com/problems/single-number-iii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_260.java)| O(n)|O(n) | Medium|
 |259|[3Sum Smaller](https://leetcode.com/problems/3sum-smaller/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_259.java)| O(n^2)|O(1) | Medium|
 |258|[Add Digits](https://leetcode.com/problems/add-digits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_258.java)| O(1)|O(1) | Easy|
 |257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_257.java) | O(n*h) | O(h) | DFS/Recursion
diff --git a/src/main/java/com/fishercoder/solutions/_260.java b/src/main/java/com/fishercoder/solutions/_260.java
@@ -3,10 +3,7 @@
 import java.util.HashMap;
 import java.util.Map;
 
-/**260. Single Number III  QuestionEditorial Solution  My Submissions
-Total Accepted: 42536
-Total Submissions: 92175
-Difficulty: Medium
+/**260. Single Number III
 Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
 
 For example:
@@ -17,17 +14,16 @@
 The order of the result is not important. So in the above example, [5, 3] is also correct.
 Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?
 */
-public class SingleNumberIII {
-//    TODO: study its bit manipulation way, this is a MUST!
-    
-    
+
+public class _260 {
+
     //Approach 1: normal hashmap
     public int[] singleNumber(int[] nums) {
         Map<Integer, Integer> map = new HashMap();
         for(int i : nums){
             map.put(i, map.getOrDefault(i, 0)+1);
         }
-        
+
         int[] res = new int[2];
         int index = 0;
         for(int key : map.keySet()){
@@ -36,4 +32,5 @@ public int[] singleNumber(int[] nums) {
         }
         return res;
     }
+//    TODO: study its bit manipulation way, this is a MUST!
 }
