Add solution #537

Author: JoshCrozier

README.md

@@ -427,6 +427,7 @@
 529|[Minesweeper](./0529-minesweeper.js)|Medium|
 530|[Minimum Absolute Difference in BST](./0530-minimum-absolute-difference-in-bst.js)|Easy|
 532|[K-diff Pairs in an Array](./0532-k-diff-pairs-in-an-array.js)|Medium|
+537|[Complex Number Multiplication](./0537-complex-number-multiplication.js)|Medium|
 541|[Reverse String II](./0541-reverse-string-ii.js)|Easy|
 542|[01 Matrix](./0542-01-matrix.js)|Medium|
 543|[Diameter of Binary Tree](./0543-diameter-of-binary-tree.js)|Easy|

solutions/0537-complex-number-multiplication.js

@@ -0,0 +1,24 @@
+/**
+ * 537. Complex Number Multiplication
+ * https://leetcode.com/problems/complex-number-multiplication/
+ * Difficulty: Medium
+ *
+ * A complex number can be represented as a string on the form "real+imaginaryi" where:
+ * - real is the real part and is an integer in the range [-100, 100].
+ * - imaginary is the imaginary part and is an integer in the range [-100, 100].
+ * - i2 == -1.
+ *
+ * Given two complex numbers num1 and num2 as strings, return a string of the complex number
+ * that represents their multiplications.
+ */
+
+/**
+ * @param {string} num1
+ * @param {string} num2
+ * @return {string}
+ */
+var complexNumberMultiply = function(num1, num2) {
+  const [r1, i1] = num1.split('+').map(n => parseInt(n.replace('i', '')));
+  const [r2, i2] = num2.split('+').map(n => parseInt(n.replace('i', '')));
+  return `${r1 * r2 - i1 * i2}+${r1 * i2 + r2 * i1}i`;
+};