Skip to content

Files

Latest commit

author
Shuo
Jul 10, 2021
62f1dec · Jul 10, 2021

History

History

maximum-swap

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Jul 10, 2021
Nov 12, 2019
Nov 12, 2019

< Previous                  Next >

You are given an integer num. You can swap two digits at most once to get the maximum valued number.

Return the maximum valued number you can get.

 

Example 1:

Input: num = 2736
Output: 7236
Explanation: Swap the number 2 and the number 7.

Example 2:

Input: num = 9973
Output: 9973
Explanation: No swap.

 

Constraints:

  • 0 <= num <= 108

Related Topics

[Greedy] [Math]

Similar Questions

  1. Create Maximum Number (Hard)