.

Author: MaskRay

maximum-xor-of-two-numbers-in-an-array.cc

@@ -2,17 +2,16 @@
 class Solution {
 public:
   int findMaximumXOR(vector<int>& nums) {
-    int m = 0, r = 0;
+    int r = 0;
     unordered_set<int> s;
     for (int i = 30; i >= 0; i--) {
-      m |= 1<<i;
+      int m = r | 1<<i;
       s.clear();
       for (int x: nums)
         s.insert(x & m);
-      int t = r|1<<i;
       for (int x: s)
-        if (s.count(x^t)) {
-          r = t;
+        if (s.count(x^m)) {
+          r = m;
           break;
         }
     }

merge-bsts-to-create-single-bst.cc

@@ -25,7 +25,7 @@ class Solution {
       if (TreeNode *y = x->left) {
         while (y->right && y->right != x)
           y = y->right;
-        if (y->right != x) {
+        if (!y->right) {
           y->right = x;
           x = x->left;
           continue;