Leetcode-537. Complex Number Multiplication

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。这次比赛略无语，没想到前3题都可以用暴力解。

博客链接：mcf171的博客

——————————————————————————————

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]. And the output should be also in this form.

这个题目的思路是先把复数转为对应的数值，然后再运用对应的运算规则即可。

public class Solution {
    public String complexNumberMultiply(String a, String b) {
        int[] num1 = transfer(a);
        int[] num2 = transfer(b);
        StringBuffer sb = new StringBuffer("");
        sb.append(num1[0] * num2[0] + -1*(num1[1] * num2[1]));
        sb.append("+");
        sb.append(num1[0] * num2[1] + num1[1] * num2[0]);
        sb.append("i");
        return sb.toString();
    }
    
    private int[] transfer(String a){
        int flag = 1;
        int[] result = new int[2];
        int index = 0;
        if(a.charAt(index) == '-') {flag = -1;index ++;}
        while(index < a.length()){
            if(a.charAt(index) == '+')break;
            result[0] = result[0] * 10 + a.charAt(index) - '0';
            index ++;
        }
        result[0] *= flag;
        index ++;
        flag = 1;
        if(a.charAt(index) == '-') {flag = -1;index ++;}
        while(index < a.length()){
            if(a.charAt(index) == 'i')break;
            result[1] = result[1] * 10 + a.charAt(index) - '0';
            index ++;
        }
        result[1] *= flag;
        return result;
    }
}