面试手撕代码（8）——大数问题

大数相乘

//AB * CD = AC (AD+BC) BD
public class BigIntMultiply {
    public static void main(String[] args) {
        String a="67";
        String b="89";
        System.out.println(multiply(a,b));
    }
    public static String multiply(String str1,String str2){
        int[] num1 = new int[str1.length()];
        int[] num2 = new int[str2.length()];
        int[] result = new int[str1.length()+str2.length()];
        //将两个字符串转成整型数组，顺序转换，数组下标越小，数字对应的位数越高
        for(int i=0;i<str1.length();i++){
            num1[i]=Integer.parseInt(str1.substring(i,i+1));
        }
        for(int i=0;i<str2.length();i++){
            num2[i]=Integer.parseInt(str2.substring(i,i+1));
        }
        //大数相乘
        for(int i=0;i<str1.length();i++){
            for(int j=0;j<str2.length();j++){
            	//对应位置的影响
                result[i+j] += num1[i]*num2[j];
            }
        }
        //判断进位，满10进1,因为存储顺序与位数高低相反，所以采用逆序进位
        int temp;
        //注意细节，k>0，因为我们要取前一位k-1
        //并且这里result[result.length-1]是空的
        for(int k=result.length-1;k>0;k--){
            temp=result[k]/10;//进位
            result[k-1]+=temp;
            result[k]=result[k]%10;
        }
        StringBuilder ans=new StringBuilder();
        //将结果数组转化为字符串
        for(int i=0;i<result.length-1;i++){
            ans.append(result[i]);
        }
        return ans.toString();
    }
}

---

大数相加减

大数相加

public class BigIntAdd {
    public static void main(String[] args) {
        String a="1111111111111111111111";
        String b="8888888888888888888889";
        String c="10000000000000000000000";
        System.out.println(add(a,b));

    }
    public static String add(String str1,String str2) {
        StringBuilder sb = new StringBuilder();
        int carry = 0;
        int sum = 0;
        int temp = 0;
        //第一次反转
        str1 = (new StringBuilder(str1)).reverse().toString();
        str2 = (new StringBuilder(str2)).reverse().toString();
        int len1 = str1.length();
        int len2 = str2.length();
        int maxlen = Math.max(len1,len2);
        for (int i = 0; i < maxlen; i++) {
            int num1 = i > len1 - 1 ? 0 : str1.charAt(i) - '0';
            int num2 = i > len2 - 1 ? 0 : str2.charAt(i) - '0';
            sum = carry + num1 + num2;
            temp = sum % 10;
            carry = sum / 10;
            sb.append(temp);
        }
        if(carry != 0){
            sb.append(carry);
        }
        return sb.reverse().toString();
    }
}

大数相减

public class BigIntSub {
    public static void main(String[] args) {
        String a="11111111111111111";
        String b="1111111111111111";
        String c="10000000000000000";
        System.out.println(sub(a,b));

    }
    public static String sub(String str1,String str2) {
        char[] c1 = (new StringBuilder(str1)).reverse().toString().toCharArray();
        char[] c2 = (new StringBuilder(str2)).reverse().toString().toCharArray();
        int len1 = c1.length;
        int len2 = c2.length;
        int len = Math.max(len1, len2);
        int[] result = new int[len];
        char sign = '+';
        if(len1 < len2){
            sign = '-';
        }else if(len1 == len2){
            int i = len - 1;
            while (i > 0 || c1[i] == c2[i]){
                i--;
            }
            if(i == 0 && c1[i] == c2[i]){
                return "0";
            }
            if(c1[i] < c2[i]){
                sign = '-';
            }
        }
        //计算结果集，如果最终结果为正，那么就a-b否则的话就b-a
        for (int i = 0; i < len; i++) {
            int num1 = i < len1 ? c1[i] - '0' : 0;
            int num2 = i < len2 ? c2[i] - '0' : 0;
            if(sign == '+'){
                result[i] = num1 - num2;
            }else{
                result[i] = num2 - num1;
            }
        }
        //如果结果集合中的某一位小于零，那么就向前一位借一，然后将本位加上10。其实就相当于借位做减法
        for (int i = 0; i < len - 1; i++) {
            if(result[i] < 0){
                result[i + 1] -= 1;
                result[i] += 10;
            }
        }
        StringBuilder sb = new StringBuilder();
        if(sign == '-'){
            sb.append('-');
        }
        //判断是否有前置0
        int idx = len - 1;
        while (result[idx] == 0){
            idx--;
        }
        for (int i = idx; i > 0; i--) {
            sb.append(result[i]);
        }
        return sb.toString();
    }
}

大数阶乘