Update 0001-two-sum.cpp

My solution resembles more like shown in neetcode video and also has better runtime

Author: Akshat202002

cpp/0001-two-sum.cpp

@@ -11,20 +11,16 @@
 class Solution {
 public:
     vector<int> twoSum(vector<int>& nums, int target) {
-        unordered_map<int, int> m;
-        vector<int> result;
-        
-        for (int i = 0; i < nums.size(); i++) {
-            int complement = target - nums[i];
-            if (m.find(complement) != m.end()) {
-                result.push_back(m[complement]);
-                result.push_back(i);
-                break;
-            } else {
-                m.insert({nums[i], i});
+        int n = nums.size();
+        unordered_map<int, int> mp; // val -> index
+
+        for (int i = 0; i < n; i++) {
+            int compliment = target - nums[i];
+            if (mp.find(compliment) != mp.end()) {
+                return {mp[compliment], i};
             }
+            mp.insert({nums[i], i});
         }
-        
-        return result;
+        return {};
     }
 };