slight midification and removed the debug code

Author: haoel

algorithms/cpp/accountsMerge/AccountsMerge.cpp

@@ -168,7 +168,7 @@ class Solution {
     bool join(unordered_map<int, int>& emails_chains, int id1, int id2) {
         int e1 = find(emails_chains, id1);
         int e2 = find(emails_chains, id2);
-        if ( e1 != e2 )  emails_chains[e1] = id2;
+        if ( e1 != e2 )  emails_chains[e1] = e2;
         return e1 == e2;
     }
 };

algorithms/cpp/friendCircles/FriendCircles.cpp

@@ -104,7 +104,7 @@ class Solution {
     bool join(vector<int> &relations, int x, int y) {
         int tx = find(relations, x);
         int ty = find(relations, y);
-        if ( tx != ty ) relations[tx] = y;
+        if ( tx != ty ) relations[tx] = ty;
         return tx != ty;
     }
 

algorithms/cpp/satisfiabilityOfEqualityEquations/SatisfiabilityOfEqualityEquations.cpp

@@ -78,7 +78,7 @@ class Solution {
         char tx = find(x);
         char ty = find(y);
         if (tx != ty) { 
-            eq_map[tx] = y;
+            eq_map[tx] = ty;
         }
     }
 
@@ -90,7 +90,6 @@ class Solution {
         }
         for (auto e : equations) {
             if (e[1] == '!' && (e[0] == e[3] || find(e[0]) == find(e[3]) ) ) { 
-                cout << e << " " << find(e[0]) << find(e[3]) << endl;
                 return false;
             }
         }