leetcode 670. Maximum Swap 交換2個位置得到最大值

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.ios Example 1: Input: 2736 Output: 7236 Explanatio
相關文章
相關標籤/搜索