refactor 1

Author: fishercoder1534

cpp/_1.cpp

@@ -23,7 +23,7 @@ class Solution {
             if (m.find(nums[i]) == m.end() ) {
             // store the first one poisition into the second one's key
                 m[target - nums[i]] = i;
-            }else {
+            } else {
             // found the second one
                 result.push_back(m[nums[i]]);
                 result.push_back(i);