leetcode 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.java Example 1: git Input: 2736 Output: 7236 Expla

>>阅读原文<<