3783.整数的镜像距离

LeetCode 算法题解与代码实现

class Solution {
    public int mirrorDistance(int n) {
        return Math.abs(n - reverse(n));
    }

    private int reverse(int num) {
        int ret = 0;
        while (num > 0) {
            ret = ret  * 10 + num % 10;
            num /= 10;
        }
        return ret;
    }
}