62进制加法

package bytedance.interview;

import java.util.HashMap;

/**
 * Copyright (c) 2020.
 * Email: love1208tt@foxmail.com
 *
 * @author lyg  2020/3/22 下午5:18
 * description: 实现62进制的加法
 **/

public class Solution2 {
    private HashMap<String, Integer> map;

    private Solution2() {
        map = new HashMap<>(62);
        for (int i = 0; i <= 9; i++) {
            map.put(String.valueOf(i), i);
        }
        for (int i = 0; i <= 25; i++) {
            int ch = 'a' + i;
            map.put(String.valueOf((char) (ch)), 10 + i);
        }
        for (int i = 0; i <= 25; i++) {
            int ch = 'A' + i;
            map.put(String.valueOf((char) (ch)), 36 + i);
        }
    }

    private String getKey(int value) {
        for (String key : map.keySet()) {
            Integer val = map.get(key);
            if (val != null && val.equals(value)) {
                return key;
            }
        }
        return null;
    }

    private String calculateRest(char[] array, int p, int JW) {
        StringBuilder builder = new StringBuilder();
        int length = array.length, valA, res;
        while (p < length) {
            valA = map.get(String.valueOf(array[length - p - 1]));
            res = valA + JW;
            if (res >= 62) {
                String key = getKey(res - 62);
                builder.insert(0, key);
                JW = 1;
            } else {
                String key = getKey(res);
                builder.insert(0, key);
                JW = 0;
            }
            p++;
        }
        if (JW == 1) {
            builder.insert(0, JW);
        }
        return builder.toString();
    }

    private String add(String numA, String numB) {
        char[] arrA = numA.toCharArray();
        char[] arrB = numB.toCharArray();
        int lenA = arrA.length;
        int lenB = arrB.length;
        int length = Math.min(arrA.length, arrB.length);
        StringBuilder builder = new StringBuilder();
        int JW = 0;
        int valA, valB;
        int res, p = 0;
        while (p < length) {
            valA = map.get(String.valueOf(arrA[lenA - p - 1]));
            valB = map.get(String.valueOf(arrB[lenB - p - 1]));
            res = valA + valB + JW;
            if (res >= 62) {
                String key = getKey(res - 62);
                builder.insert(0, key);
                JW = 1;
            } else {
                String key = getKey(res);
                builder.insert(0, key);
                JW = 0;
            }
            p++;
        }
        if (p < lenA || p < lenB) {
            String result = p < lenA ? calculateRest(arrA, p, JW) : calculateRest(arrB, p, JW);
            builder.insert(0, result);
        } else if (JW == 1) {
            builder.insert(0, JW);
        }
        return builder.toString();
    }

    public static void main(String[] args) {
        Solution2 solution2 = new Solution2();
        String numA = "1Z";
        String numB = "Z";
        String res = solution2.add(numA, numB);
        System.out.println(res);
        numA = "abc";
        numB = "abc";
        res = solution2.add(numA, numB);
        System.out.println(res);
        numA = "dabc";
        numB = "abc";
        res = solution2.add(numA, numB);
        System.out.println(res);
    }
}