Leetcode1-100: 43. Multiply Strings

问题描述

Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.

Example 1:

Input: num1 = "2", num2 = "3"
Output: "6"

Example 2:

Input: num1 = "123", num2 = "456"
Output: "56088"

Note:

The length of both num1 and num2 is < 110.
Both num1 and num2 contain only digits 0-9.
Both num1 and num2 do not contain any leading zero, except the number 0 itself.
You must not use any built-in BigInteger library or convert the inputs to integer directly.

题目要求： 输入两个字符串表示两个数字，输出两个数字相乘的字符串。（注意溢出问题，有可能是很长的串）

解题思路

按照乘法的运算实际来算，将两个字符串转换成数组然后算即可。

代码实现

public String multiply(String num1, String num2) {
        int m = num1.length();
        int n = num2.length();
        int[] res = new int[m + n];
        // 因为有进位，应该从m-1，n-1开始
        for (int i = m - 1; i >= 0; i--) {
            for (int j = n - 1; j >= 0; j--) {
                int cur = (num1.charAt(i) - '0') * (num2.charAt(j) - '0');
                // 加上进位,res[i+j+1]最大为9，cur最大为81，所以相加最大不超过99
                cur += res[i + j + 1];
                // 每进行一次相乘，对应的res[i+j+1],res[i+j]都会更新
                res[i + j + 1] = cur % 10;
                res[i + j] += cur / 10;
            }
        }
        // res数组前面几位可能为零
        StringBuilder sb = new StringBuilder();
        for (int ele : res) {
            if (!(sb.length() == 0 && ele == 0)) {
                sb.append(ele);
            }
        }
        return sb.length() == 0 ? "0" : sb.toString();
    }

复杂度分析：

时间复杂度： O(mn), m,n分别是两个字符串的长度
空间复杂度： O(1)

分析后记

无