Solution (leetcode-in-java 1.23 API)

java.lang.Object
- g0601_0700.s0670_maximum_swap.Solution

```
public class Solution
extends Object
```
670 - Maximum Swap.
Medium

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 <= 10⁸

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int maximumSwap(int num)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail
- maximumSwap
```
public int maximumSwap(int num)
```