Runtime: 4 ms (Top 41.52%) | Memory: 6.3 MB (Top 21.58%)

Author: AnasImloul

scripts/algorithms/C/Check if One String Swap Can Make Strings Equal/Check if One String Swap Can Make Strings Equal.cpp

@@ -1,8 +1,9 @@
+// Runtime: 4 ms (Top 41.52%) | Memory: 6.3 MB (Top 21.58%)
 /*
     https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/
-    
+
     Find the number of positions which are different.
-    Now the strings can be made equal only if there are 0 
+    Now the strings can be made equal only if there are 0
     different positions or 2 different positions and there are
     chars on those positions which when swaped will make the
     strings equal.
@@ -18,7 +19,7 @@ class Solution {
         for(int i = 0; i < s1.size(); i++) {
             if(s1[i] != s2[i])
                 diff_pos.emplace_back(i);
-            // If there are more than 2 char positions that differ, 
+            // If there are more than 2 char positions that differ,
             // the single swap op cannot anyway make the two strings equal
             if(diff_pos.size() > 2)
                 return false;
@@ -27,9 +28,9 @@ class Solution {
         if(diff_pos.empty())
             return true;
         // only one pair of diff positions, check if swapping makes them equal
-        if(diff_pos.size() == 2) 
+        if(diff_pos.size() == 2)
             swap(s1[diff_pos[0]], s1[diff_pos[1]]);
-        
+
         return s1 == s2;
     }
-};
+};