no tricky solution

Author: haoel

algorithms/cpp/twoSum/twoSum.cpp

@@ -66,4 +66,19 @@ class Solution {
         }
         return result;
     }
+
+    // we also can store nums[i] into map, and find target - nums[i]
+    vector<int> twoSum(vector<int>& nums, int target) {
+        unordered_map<int, int> m;
+        vector<int> result;
+        for (int i=0; i<nums.size(); i++) {
+            if ( m.find(target - nums[i]) == m.end() ) {
+                m[nums[i]] = i;
+            }else{
+                result.push_back(m[target - nums[i]]);
+                result.push_back(i);
+            }
+        }
+        return result;
+    }
 };