LeetCode-537. Complex Number Multiplication

本文介绍了一种通过解析两个字符串形式的复数并计算它们乘积的方法。具体地,文章提供了一个示例代码,该代码将输入的复数字符串转换为整数,然后计算其乘积,并最终返回以字符串形式表示的复数乘积结果。

Given two strings representing two complex numbers.

You need to return a string representing their multiplication. Note i2 = -1 according to the definition.

Example 1:

Input: "1+1i", "1+1i"
Output: "0+2i"
Explanation: (1 + i) * (1 + i) = 1 + i2 + 2 * i = 2i, and you need convert it to the form of 0+2i.

Example 2:

Input: "1+-1i", "1+-1i"
Output: "0+-2i"
Explanation: (1 - i) * (1 - i) = 1 + i2 - 2 * i = -2i, and you need convert it to the form of 0+-2i.

Note:

  1. The input strings will not have extra blank.
  2. The input strings will be given in the form of a+bi, where the integer a and b will both belong to the range of [-100, 100]. Andthe output should be also in this form.

solution:

class Solution {
    public String complexNumberMultiply(String a, String b) {
        //x="a+bi", y="c+di"
        //x*y=(ac-bd)+(bc+ad)i
	String[] as=a.split("\\+|i");	
	int[] arri=new int[as.length];
	for(int i=0;i<as.length;i++)
	    arri[i]=Integer.parseInt(as[i]);
        //a=arri[0]; b=arri[1];
		
	String[] bs=b.split("\\+|i");	
	int[] arri2=new int[bs.length];
	for(int i=0;i<bs.length;i++)
            arri2[i]=Integer.parseInt(bs[i]);
        // c=arri2[0] d=arri2[1];
        
        return (arri[0]*arri2[0]-arri[1]*arri2[1])+"+"+(arri[1]*arri2[0]+arri[0]*arri2[1])+"i";
    }
}

评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值