LeetCode 43. Multiply Strings（乘法）

最新推荐文章于 2021-08-11 17:44:43 发布

jmspan

最新推荐文章于 2021-08-11 17:44:43 发布

阅读量569

点赞数

分类专栏：字符串数字乘法四则运算文章标签： leetcode

本文链接：https://blog.csdn.net/jmspan/article/details/51459866

版权

字符串同时被 3 个专栏收录

30 篇文章 0 订阅

订阅专栏

数字

21 篇文章 0 订阅

订阅专栏

四则运算

7 篇文章 0 订阅

订阅专栏

本文介绍了一种解决LeetCode上大数相乘问题的方法，该问题要求输入两个字符串形式的大数并返回它们的乘积，同时不允许使用BigInteger等内部库进行转换。通过模拟手工乘法过程，该算法能有效处理任意大小的非负整数。

摘要由CSDN通过智能技术生成

原题网址：https://leetcode.com/problems/multiply-strings/

Given two numbers represented as strings, return multiplication of the numbers as a string.

Note:

The numbers can be arbitrarily large and are non-negative.
Converting the input string to integer is NOT allowed.
You should NOT use internal library such as BigInteger.

方法：模拟乘法运算。

public class Solution {
    public String multiply(String num1, String num2) {
        int[] n1 = new int[num1.length()];
        int[] n2 = new int[num2.length()];
        int[] m = new int[num1.length() + num2.length()];
        for(int i=0; i<n1.length; i++) {
            n1[n1.length-1-i] = num1.charAt(i)-'0';
        }
        for(int i=0; i<n2.length; i++) {
            n2[n2.length-1-i] = num2.charAt(i)-'0';
        }
        for(int i=0; i<n1.length; i++) {
            int carry = 0;
            for(int j=0; j<n2.length; j++) {
                int mul = m[i+j] + n1[i]*n2[j] + carry;
                m[i+j] = mul % 10;
                carry = mul / 10;
            }
            if (carry > 0) m[i+n2.length] += carry;
        }
        boolean notZero = false;
        StringBuilder sb = new StringBuilder();
        for(int i=m.length-1; i>=0; i--) {
            if (m[i] > 0) notZero = true;
            if (notZero) sb.append(m[i]);
        }
        if (!notZero) sb.append(0);
        return sb.toString();
    }
}