Leetcode之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. 示例一： Input: 2736 Output: 7236 Explanation:

>>阅读原文<<