Leetcode Problem 670. Maximum Swap

670. Maximum Swap

Leetcode Solutions

Convert the integer num to a character array digits.
Create an array buckets to record the last position of each digit (0-9) in digits.
Iterate through digits from left to right.
For each digit, check if there is a larger digit that appears later in the number.
If a larger digit is found, swap it with the current digit.
Convert the character array back to an integer and return it.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen