g0601_0700.s0670_maximum_swap.readme.md Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation

Java Solution for LeetCode algorithm problems, continually updating

The newest version!

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⁸