LeetCode--medium--multiply_strings_43

summary:

handle carry

package myapp.kit.leetcode.top200;

/**
 * 43
 * medium
 * https://leetcode.com/problems/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.
 *
 * @author huangdingsheng
 * @version 1.0, 2020/6/24
 */
public class multiply_strings_43 {

    public static String multiply(String num1, String num2) {
        char[] ch1 = num1.toCharArray();
        char[] ch2 = num2.toCharArray();
        int x = num1.length();
        int y = num2.length();
        int[] answer = new int[x + y];
        // 1. calculate each item
        for (int i = 0; i < x; i++) {
            for (int j = 0; j < y; j++) {
                answer[i + j + 1] += (ch1[i] - '0') * (ch2[j] - '0');
            }
        }
        // 2. process carry
        int idx1 = 0;
        while (idx1 < answer.length && answer[idx1] == 0) {
            idx1++;
        }
        for (int i = answer.length - 1; i > idx1; i--) {
            if (answer[i] >= 10) {
                answer[i - 1] += answer[i] / 10;
                answer[i] = answer[i] % 10;
            }
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < answer.length; i++) {
            sb.append(answer[i]);
        }
        int idx = 0;
        while (idx <= sb.length() - 1 && sb.charAt(idx) == '0') {
            idx++;
        }
        return idx <= sb.length() - 1 ? sb.substring(idx) : "0";
    }

    public static void main(String[] args) {
        System.out.println(multiply("2", "3"));
    }
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值