grammar (haoel#259)

cad0p · web-flow · commit 36168cc9e130 · 2021-11-12T14:44:57.000+08:00
diff --git a/algorithms/cpp/twoSum/twoSum.cpp b/algorithms/cpp/twoSum/twoSum.cpp
@@ -46,16 +46,16 @@ class Solution {
     //
     //  1) Traverse the array one by one
     //  2) just put the `target - num[i]`(not `num[i]`) into the map
-    //     so, when we checking the next num[i], if we found it is exisited in the map.
-    //     which means we found the second one.
+    //     so, when we checking the next num[i], if we found it existed in the map,
+    //     it means we found the second one.
     //      
     vector<int> twoSum(vector<int> &numbers, int target) {
         unordered_map<int, int> m;
         vector<int> result;
         for(int i=0; i<numbers.size(); i++){
             // not found the second one
             if (m.find(numbers[i])==m.end() ) { 
-                // store the first one poisition into the second one's key
+                // store the first one position into the second one's key
                 m[target - numbers[i]] = i; 
             }else { 
                 // found the second one
