added Maximum Swap (medium)

Author: minhyeong-joe

Medium/MaximumSwap/README.md

@@ -0,0 +1,24 @@
+
+# Maximum Swap
+[Leetcode Link](https://leetcode.com/problems/maximum-swap/)
+
+## Problem:
+
+Given a non-negative integer, you could swap two digits **at most** once to get the maximum valued number. Return the maximum valued number you could get.
+
+## Example:
+
+```
+Input: 2736
+Output: 7236
+Explanation: Swap the number 2 and the number 7.
+```
+```
+Input: 9973
+Output: 9973
+Explanation: No swap.
+```
+
+## Note:
+
+- The given number is in the range [0, 108]

Medium/MaximumSwap/solution.py

@@ -0,0 +1,26 @@
+class Solution:
+ def maximumSwap(self, num: int) -> int:
+ arr = list(str(num))
+ # print(arr)
+ for i, n in enumerate(arr):
+ n = int(n)
+ maxNum = max([int(num) for num in arr[i:]])
+ if maxNum > n:
+ for j in range(len(arr)-1, i-1, -1):
+ if int(arr[j]) == maxNum:
+ arr[i], arr[j] = arr[j], arr[i]
+ # print(arr)
+ return int("".join(arr))
+ return int("".join(arr))
+
+
+
+# test driver
+sol = Solution()
+num = 2736
+print("Input:", num)
+print("Output:", sol.maximumSwap(num))
+
+num = 98368
+print("Input:", num)
+print("Output:", sol.maximumSwap(num))

README.md

@@ -71,6 +71,7 @@ Languages used: Java and Python
  - [Predict the Winner](Medium/PredictWinner)
  - [Subarray Sum Equals K](Medium/SubarraySumEqualsK)
  - [Find Minimum in Rotated Sorted Array](Medium/FindMinInRotatedSortedArray)
+ - [Maximum Swap](Medium/MaximumSwap)
 - Hard
  - [Maximum Score Words Formed by Letters](Hard/MaximumScoreWords)
  - [Reducing Dishes](Hard/ReducingDishes)