LeetCode 537. Complex Number Multiplication

Description

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:
The input s**trings will not have extra blank.
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]. And the output should be also in this form.
Subscribe to see which companies asked this question.

Code

class Solution {
public:
    string complexNumberMultiply(string a, string b) {
        int xa=stoi(a.substr(0,a.find('+')));
        int xb=stoi(b.substr(0,b.find('+')));
        int ya=stoi(a.substr(a.find('+')+1,a.find('i')-a.find('+')-1));
        int yb=stoi(b.substr(b.find('+')+1,b.find('i')-b.find('+')-1));
        string result = to_string(xa*xb-ya*yb) + "+" + to_string(xa*yb+xb*ya) + "i";
        return result;
    }
};

Appendix

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值