Write a method called swapDigitPairs that accepts an integer n as a parameter and returns a new integer whose value is similar to n’s but with each pair of digits swapped in order. For example, the call of swapDigitPairs(482596 ) would return 845269. Notice that the 9 and 6 are swapped, as are the 2 and 5, and the 4 and 8. If the number contains an odd number of digits, leave the leftmost digit in its original place. For example, the call of swapDigitPairs( 123 4567 ) would return 1325476. You should solve this problem without using a String.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.