Complex Number Multiplication问题及解法
2017-08-18 13:57
375 查看
问题描述:
Given two strings representing two complex numbers.
You need to return a string representing their multiplication. Note i2 = -1 according to the definition.
示例:
Note:
The input strings 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.
问题分析:
将每个负数的a和b提取出来,根据运算规则,计算出新的a和b。
过程详见代码:
class Solution {
public:
string complexNumberMultiply(string a, string b) {
int i = a.find("+");
int j = b.find("+");
int a1 = stoi(a.substr(0,i+1));
int b1 = stoi(a.substr(i + 1,a.length() - i - 1));
int a2 = stoi(b.substr(0, j + 1));
int b2 = stoi(b.substr(j + 1, b.length() - j - 1));
return to_string(a1*a2 - b1*b2) + "+" + to_string(a1*b2 + a2*b1) + "i";
}
};
Given two strings representing two complex numbers.
You need to return a string representing their multiplication. Note i2 = -1 according to the definition.
示例:
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.
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 strings 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.
问题分析:
将每个负数的a和b提取出来,根据运算规则,计算出新的a和b。
过程详见代码:
class Solution {
public:
string complexNumberMultiply(string a, string b) {
int i = a.find("+");
int j = b.find("+");
int a1 = stoi(a.substr(0,i+1));
int b1 = stoi(a.substr(i + 1,a.length() - i - 1));
int a2 = stoi(b.substr(0, j + 1));
int b2 = stoi(b.substr(j + 1, b.length() - j - 1));
return to_string(a1*a2 - b1*b2) + "+" + to_string(a1*b2 + a2*b1) + "i";
}
};
相关文章推荐
- Minimum Number of Arrows to Burst Balloons问题及解法
- Perfect Number问题及解法
- LeetCode.537 Complex Number Multiplication
- leetcode-complex number multiplication
- 537. Complex Number Multiplication
- Ugly Number II问题及解法
- lintcode/leetcode由易至难第22题:Complex Number Multiplication
- Number of Boomerangs问题及解法
- Complex Number Multiplication
- Ugly Number问题及解法
- 537. Complex Number Multiplication
- LeetCode Complex Number Multiplication
- Guess Number Higher or Lower问题及解法
- Valid Triangle Number问题及解法
- 537. Complex Number Multiplication
- 537. Complex Number Multiplication
- Binary Number with Alternating Bits问题及解法
- LeetCode - Complex Number Multiplication
- Guess Number Higher or Lower II问题及解法
- 537. Complex Number Multiplication