edit 1

Author: fishercoder1534

README.md

@@ -591,7 +591,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |4|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_4.java) | ? | ? | Hard | Divide and Conquer
 |3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_3.java) | O(n) | O(1) | Medium | HashMap, Sliding Window
 |2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_2.java) | O(max(m,n)) | O(1) | Medium | LinkedList
-|1|[Two Sum](https://leetcode.com/problems/two-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1.java)| O(n)/O(n^2)|O(1)/O(n) | Easy| HashMap
+|1|[Two Sum](https://leetcode.com/problems/two-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1.java)| O(n)| O(n) | Easy| HashMap
 
 ## Database
 

src/main/java/com/fishercoder/solutions/_1.java

@@ -18,7 +18,7 @@
  */
 public class _1 {
 
-    public int[] twoSum_ON(int[] nums, int target) {
+    public int[] twoSum(int[] nums, int target) {
         Map<Integer, Integer> map = new HashMap();
         int[] result = new int[2];
         for(int i = 0; i < nums.length; i++){
@@ -33,18 +33,4 @@ public int[] twoSum_ON(int[] nums, int target) {
         return result;
     }
 
-    public int[] twoSum_ON2(int[] nums, int target) {
-        int[] result = new int[2];
-        for(int i = 0; i < nums.length-1; i++){
-            for(int j = i+1; j < nums.length; j++){
-                if(nums[i] + nums[j] == target){
-                    result[0] = i;
-                    result[1] = j;
-                    break;
-                }
-            }
-        }
-        return result;
-    }
-
 }