牛客网 2018校招真题 盛大游戏 找出最接近的对称数字

Description

牛客网 2018校招真题 找出最接近的对称数字

Solving Ideas

为了使对称数字最接近，应该尽量保持高位不变，然后修改低位数字从而达到对称。

考虑比较特殊的数字如：

• 10,100,1000
• 101,1001,10001
• 99,999,9999

Time complexity : $O(n)$
Space complexity : $O(n)$

Solution

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

/**
 * @author wylu
 */
public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        char[] str = br.readLine().toCharArray();
        long num = Long.parseLong(new String(str));
        if (num == 11) {
            System.out.println(9);
            return;
        }

        char[] a, b;
        int n = (int) Math.log10(num) + 1, mid = n / 2;
        long num1 = (long) (num + Math.pow(10, mid)), num2;
        if (isPalindrome(str)) {
            num2 = (long) (num - Math.pow(10, (n % 2 == 0 && str[mid] == '0') ? mid - 1 : mid));
        } else {
            num2 = (long) (num - Math.pow(10, (n % 2 == 0) ? mid - 1 : mid));
            b = cover(String.valueOf(num2).toCharArray());
            cover(str);
            num2 = Long.parseLong(new String(b));
            long num3 = Long.parseLong(new String(str));
            if (Math.abs(num3 - num) < num - num2) num2 = num3;
        }

        a = cover(String.valueOf(num1).toCharArray());
        b = cover(String.valueOf(num2).toCharArray());
        num1 = Long.parseLong(new String(a));
        num2 = Long.parseLong(new String(b));
        if (num1 - num < Math.abs(num - num2)) System.out.println(new String(a));
        else System.out.println(new String(b));
    }

    private static boolean isPalindrome(char[] s) {
        for (int i = 0, j = s.length - 1; i < j; i++, j--) {
            if (s[i] != s[j]) return false;
        }
        return true;
    }

    private static char[] cover(char[] s) {
        int len = s.length;
        int mid = (len % 2 == 0) ? len / 2 : len / 2 + 1;
        for (int i = mid, j = (len % 2 == 0) ? 1 : 2; i < len; i++, j += 2) {
            s[i] = s[i - j];
        }
        return s;
    }
}