Leetcode Mulitiply 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.

算法其实是实现乘法运算规则

public class Solution {
    public String multiply(String num1, String num2) {
		// Start typing your Java solution below
		// DO NOT write main() function
		int len1 = num1.length();
		int len2 = num2.length();
		ArrayList<Integer> cache = new ArrayList<Integer>(len1 + len2);
                // cache用来存储每一位当前的结果, 0 + 0 是个位,0 + 1 or 1 + 0是十位......
		for(int i = 0; i < len1 + len2; i++)
			cache.add(0);
		for(int i = 0; i < len1; i++){
			int n1 = num1.charAt(len1 - 1 - i) - '0';
			int carry = 0;
			for(int j = 0; j < len2; j++){
				int n2 = num2.charAt(len2 - 1 - j) - '0';
				carry = n1 * n2 + carry + cache.get(i + j);
				cache.set(i + j, carry % 10);
				carry /= 10;
			}
			cache.set(i + len2, carry);
		}
		
		int i = len1 + len2 - 1;
		while(i > 0 && cache.get(i) == 0)
			i--;
		StringBuilder sb = new StringBuilder("");
		while(i >= 0)
			sb.append(cache.get(i--));
		return sb.toString();
	}
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值