LeetCode 537. Complex Number Multiplication(string转int,int转string)

题目：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 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.

简单地说，这道题就是算两个复数的乘积，但是由于输入和输出都是string型，所以涉及到string转成int型、int型转成string型。其中string型转int型可以用atoi(string.c_str())，即先把string转成char *指针，再调用atoi转成int型，记得加头文件stdlib.h；而把int型转换成string型，可以直接用to_string(int)。另外，string转字符串指针为str.c_str()，字符串指针转string为char *a=”sdaf”; str = a;

另外，java和python有split函数可以直接用，C++好像没有，只能先找到要切割的位置然后再用string.substr(int begin_position, int num_to_extract)函数；

class Solution {
public:
    string complexNumberMultiply(string str1, string str2) {
        int a,b,c,d;
        int pos_add, pos_i;
        for(int i = 0; i < str1.size(); i++)
        {
            if(str1[i] == '+')
                pos_add = i;
            if(str1[i] == 'i')
                pos_i = i;
        }
        a = atoi(str1.substr(0,pos_add).c_str());
        b = atoi(str1.substr(pos_add+1, pos_i-1-pos_add).c_str());
        for(int i = 0; i < str2.size(); i++)
        {
            if(str2[i] == '+')
                pos_add = i;
            if(str2[i] == 'i')
                pos_i = i;
        }
        c = atoi(str2.substr(0,pos_add).c_str());
        d = atoi(str2.substr(pos_add+1, pos_i-1-pos_add).c_str());

        string res = to_string(a*c-b*d) + "+" + to_string(a*d+b*c) + "i";

        return res;
    }
};