题目: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.
思路:针对字符串进行拆分,每个复数可表示为 num1 + num2 * i,分别对输入a和b进行处理,然后对四个参数a1,a2,b1,b2进行乘积处理和合并。两个复数相乘之后需要注意符号变反。
输出整合:刚开始WA了,因为考虑到后项 i 的系数有可能为0的情况,但是。。。题目非常人性化,要求无论何种情况,输出格式都是 res1 + res2 i,那么只需要处理是否为0,是否为负数的情况。
代码如下:
void splitStr(string str, int &m1, int &m2) {
int i, tmp = 0, isNeg = 1;
m1 = m2 = 0;
for(i = 0; i<str.size(); i++) {
if(str[i] == '+')
break;
if(str[i] == '-') {
isNeg = -1;
continue;
}
tmp *= 10;
tmp += str[i] - '0';
}
m1 = isNeg * tmp;
tmp = 0;
isNeg = 1;
i++;
for(; i<str.size()-1; i++){
if(str[i] == '-') {
isNeg = -1;
continue;
}
tmp *= 10;
tmp += str[i] - '0';
}
m2 = isNeg * tmp;
return;
}
void attachStr(string &res, int num) {
if(num < 0){
res.push_back('-');
num *= -1;
}
if(!num)
res.push_back('0');
else{
string tmp;
while(num){
tmp.push_back(num%10 + '0');
num /= 10;
}
reverse(tmp.begin(), tmp.end());
res += tmp;
}
return;
}
string complexNumberMultiply(string a, string b) {
string res;
int a1, a2, b1, b2;
int r1, r2;
splitStr(a, a1, a2);
splitStr(b, b1, b2);
r1 = a1*b1 + (-1)*a2*b2;
r2 = a1*b2 + a2*b1;
attachStr(res, r1);
res.push_back('+');
attachStr(res, r2);
res.push_back('i');
return res;
}
结果:
欢迎大家一起讨论结题思路!^_____________________^