670

Author: lazzzis

670/Solution.java

@@ -0,0 +1,20 @@
+class Solution {
+    public int maximumSwap(int num) {
+        String n = Integer.toString(num);
+        String ans = n;
+        for (int i = 0; i < n.length(); i++) {
+            // StringBuilder sb = new StringBuilder(n);
+            for (int j = i + 1; j < n.length(); j++) {
+                StringBuilder sb = new StringBuilder(n);
+                sb.replace(i, i + 1, n.substring(j, j + 1));
+                sb.replace(j, j + 1, n.substring(i, i + 1));
+                ans = max(sb.toString(), ans);
+            }
+        }
+        return Integer.parseInt(ans);
+    }
+
+    private String max(String a, String b) {
+        return a.compareTo(b) > 0 ? a : b;
+    }
+}

670/main.js

@@ -0,0 +1,26 @@
+/**
+ * @param {number} num
+ * @return {number}
+ */
+var maximumSwap = function(num) {
+  const arr = (num + '').split('').map(x => +x)
+  const buckets = new Array(10)
+  for (let i = 0; i < arr.length; i++) {
+    buckets[arr[i]] = i
+  }
+  for (let i = 0; i < arr.length; i++) {
+    for (let j = 9; j > arr[i]; j--) {
+      if (buckets[j] > i) {
+        ;[arr[i], arr[buckets[j]]] = [arr[buckets[j]], arr[i]]
+        return +arr.join('')
+      }
+    }
+  }
+  return num
+};
+
+if (process.env.LZS) {
+  console.log(maximumSwap(1234))
+  console.log(maximumSwap(9927))
+  console.log(maximumSwap(9987))
+}

README.md

@@ -131,6 +131,7 @@
 - [581 Shortest Unsorted Continuous Subarray](./581)
 - [621 Task Scheduler](./621)
 - [628 Maximum Product of Three Numbers](./628)
+- [670 Maximum Swap](./670)
 - [675 Cut Off Trees for Golf Event](./675)
 - [681 Next Closest Time](./681)
 - [682 Baseball Game](./682)