[LeetCode 43] Multiply Strings

134 篇文章 0 订阅
49 篇文章 0 订阅

题目链接:multiply-strings


import java.util.Arrays;

/**
 * 
		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 MultiplyStrings {

	//解法一
//	311 / 311 test cases passed.
//	Status: Accepted
//	Runtime: 232 ms
//	Submitted: 0 minutes ago

	static String multiply(String num1, String num2) {
        String multi = "";
        int[] nums = new int[num1.length() + num2.length()];
        Arrays.fill(nums, 0);
        for(int i = num1.length() - 1; i >= 0; i --) {
        	for(int j = num2.length() - 1; j >= 0; j --) {
        		nums[i + j + 1] += (num1.charAt(i) - '0') * (num2.charAt(j) - '0');
        	}
        }
		for (int i = nums.length - 1; i >= 1; i--) {
			nums[i - 1] += nums[i] / 10;
			nums[i] %= 10;
		}
    	int begin = 0;
    	while(begin < nums.length - 1 && nums[begin] == 0) begin ++;
		for (int i = begin; i <= nums.length - 1; i ++) {
				multi += nums[i];
		}
    	return multi;
    }

	
	
	//解法二
//	311 / 311 test cases passed.
//	Status: Accepted
//	Runtime: 394 ms
//	Submitted: 0 minutes ago
	//代码略显臃肿,有待优化
	static String multiply1(String num1, String num2) {
        String multi = "";
        String temp = num2;
        for(int i = num1.length() - 1; i >= 0; i --) {
        	int n = num1.charAt(i) - '0';
        	multi = add(multi, multiply(temp, n));
        	temp += "0";
        }
    	int begin = 0;
    	while(begin < multi.length() - 1 && multi.charAt(begin) == '0') begin ++;
    	return multi.substring(begin);
    }
    
    static String multiply(String num1, int num2) {
    	String multi = "";
    	if(num2 == 0) return "0";
        int carray = 0;
        for(int i = num1.length() - 1; i >= 0; i --) {
        	int n = (num1.charAt(i) - '0') * num2 + carray;
        	multi = n % 10 + multi;
        	carray = n / 10;
        }
    	if(carray != 0) {
    		multi = carray % 10 + multi;
    	}
    	return multi;
    }
    static String add(String a, String b) {
    	String sum = "";
        int carray = 0;
        if(a.length() > b.length()) {
        	String temp = a;
        	a = b;
        	b = temp;
        }
        //使a和b的长度相等
        int gap = b.length() - a.length();
        while((gap--) != 0) a = "0" + a;
        
    	for (int i = b.length() - 1; i >= 0; i--) {
			int n = a.charAt(i) - '0' + b.charAt(i) - '0' + carray;
			sum = (n % 10) + sum;
			carray = n / 10;
		}
    	if(carray != 0) sum = carray % 10 + sum;
    	return sum;
    }
	public static void main(String[] args) {
		System.out.println(multiply("1000000", "99999"));

		System.out.println(multiply("1000000000000000000000000000000000000000000", "1000000000000000000000000000000000000000000"));
		
	}

}



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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值