Time: 0 ms (100%), Space: 7.6 MB (70.34%) - LeetHub

Author: MishkatIT

0670-maximum-swap/0670-maximum-swap.cpp

@@ -0,0 +1,21 @@
+class Solution {
+public:
+    int maximumSwap(int num) {
+        string x;
+        x = to_string(num);
+        int n = x.size();
+        for (int i = 0; i < n; i++) {
+            int mx = i;
+            for (int j = i + 1; j < n; j++) {
+                if (x[j] >= x[mx]) {
+                    mx = j;
+                }
+            }
+            if (x[mx] != x[i]) {
+                swap(x[i], x[mx]);
+                break;
+            }
+        }
+        return stoi(x);
+    }
+};