LeetCode670. Maximum Swap

原題：https://leetcode.com/problems/maximum-swap/description/git Given a non-negative integer, you could swap two digits at most once to get the maximum valued number. Return the maximum valued number yo

>>阅读原文<<