package
0.0.0-20190519142212-fe39b3200b40
Repository: https://github.com/imgoogege/leetcode-in-go.git
Documentation: pkg.go.dev
# README
670. Maximum Swap
题目
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 1:
Input: 2736
Output: 7236
Explanation: Swap the number 2 and the number 7.
Example 2:
Input: 9973
Output: 9973
Explanation: No swap.
Note:
- The given number is in the range [0, 10^8]
解题思路
见程序注释