LeetCode | # 43. Multiply Strings

最新推荐文章于 2020-10-02 11:54:08 发布

KarmenChan

最新推荐文章于 2020-10-02 11:54:08 发布

阅读量186

点赞数

分类专栏： LeetCode 文章标签： LeetCode java Multiply Strings

本文链接：https://blog.csdn.net/Karmen199x/article/details/102991036

版权

LeetCode 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

43. Multiply Strings

Description

描述：https://leetcode.com/problems/multiply-strings/description/
题意：将字符串表示的两个数相乘计算结果，不可调用大整数包或直接转为整数相乘。

Solution 1: (Java)

class Solution {
    public String multiply(String num1, String num2) {
        if (num1.equals("0") || num2.equals("0"))
            return "0";

        int[] result = new int[num1.length()+num2.length()];
        int[] temp;
        int n2, n1, add, mod;

        for (int i = num2.length()-1; i >= 0; i--) {
            temp = new int[num1.length()+1];
            n2 = num2.charAt(i) - '0';
            add = 0;
            for (int j = num1.length()-1; j >= 0; j--) {
                n1 = num1.charAt(j) - '0';
                mod = (n1 * n2 + add) % 10;
                add = (n1 * n2 + add) / 10;
                temp[num1.length()-1-j] = mod;
            }
            if (add != 0)
                temp[num1.length()] = add;

            add = 0;
            int count = 0;
            for (int k = 0; k < temp.length; k++) {
                if (k != temp.length-1 || (k == temp.length-1 && temp[k] != 0)) {
                    mod = (temp[k] + result[num2.length()-1 - i + k] + add) % 10;
                    add = (temp[k] + result[num2.length()-1 - i + k] + add) / 10;
                    result[num2.length()-1 - i + k] = mod;
                    count++;
                }
            }

            if (add != 0)
                result[num2.length()-1 - i + count] = add;
        }
        StringBuilder sb = new StringBuilder();
        if (result[result.length-1] != 0)
            sb.append(result[result.length-1]);
        for (int i = result.length-2; i >= 0; i--)
            sb.append(result[i]);
        return sb.toString();
    }
}

思路 1

首先想到的是按照我们人工的竖式计算方法，模拟人工的乘法和加法，时间复杂度超过21.05%，不是很高效；
注意进位、中间结果的数组下标对应问题即可。

Solution 2: (Java)

class Solution {
    public String multiply(String num1, String num2) {
        if (num1.equals("0") || num2.equals("0"))
            return "0";

        int[] result = new int[num1.length()+num2.length()];
        int n1, n2, sum;

        for (int i = num2.length()-1; i >= 0; i--) {
            n2 = num2.charAt(i) - '0';
            for (int j = num1.length()-1; j >= 0; j--) {
                n1 = num1.charAt(j) - '0';
                sum = n1 * n2 + result[result.length-2-i-j];
                result[result.length-2-i-j] = sum % 10;
                result[result.length-1-i-j] += sum / 10;
            }
        }
        StringBuilder sb = new StringBuilder();
        if (result[result.length-1] != 0)
            sb.append(result[result.length-1]);
        for (int i = result.length-2; i >= 0; i--)
            sb.append(result[i]);
        return sb.toString();
    }
}