Class Solution
-
- All Implemented Interfaces:
public final class Solution2231 - Largest Number After Digit Swaps by Parity.
Easy
You are given a positive integer
num. You may swap any two digits ofnumthat have the same parity (i.e. both odd digits or both even digits).Return the largest possible value of
numafter any number of swaps.Example 1:
Input: num = 1234
Output: 3412
Explanation: Swap the digit 3 with the digit 1, this results in the number 3214.
Swap the digit 2 with the digit 4, this results in the number 3412.
Note that there may be other sequences of swaps but it can be shown that 3412 is the largest possible number.
Also note that we may not swap the digit 4 with the digit 1 since they are of different parities.
Example 2:
Input: num = 65875
Output: 87655
Explanation: Swap the digit 8 with the digit 6, this results in the number 85675.
Swap the first digit 5 with the digit 7, this results in the number 87655.
Note that there may be other sequences of swaps but it can be shown that 87655 is the largest possible number.
Constraints:
<code>1 <= num <= 10<sup>9</sup></code>
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final IntegerlargestInteger(Integer num)-
-
Method Detail
-
largestInteger
final Integer largestInteger(Integer num)
-
-
-
-