1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-12-18 10:04:58 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p><a href=\"https://baike.baidu.com/item/%E5%A4%8D%E6%95%B0/254365?fr=aladdin\" target=\"_blank\">复数</a> 可以用字符串表示,遵循 <code>\"<strong>实部</strong>+<strong>虚部</strong>i\"</code> 的形式,并满足下述条件:</p>\n\n<ul>\n\t<li><code>实部</code> 是一个整数,取值范围是 <code>[-100, 100]</code></li>\n\t<li><code>虚部</code> 也是一个整数,取值范围是 <code>[-100, 100]</code></li>\n\t<li><code>i<sup>2</sup> == -1</code></li>\n</ul>\n\n<p>给你两个字符串表示的复数 <code>num1</code> 和 <code>num2</code> ,请你遵循复数表示形式,返回表示它们乘积的字符串。</p>\n\n<p> </p>\n\n<p><strong>示例 1</strong></p>\n\n<pre>\n<strong>输入:</strong>num1 = \"1+1i\", num2 = \"1+1i\"\n<strong>输出:</strong>\"0+2i\"\n<strong>解释:</strong>(1 + i) * (1 + i) = 1 + i2 + 2 * i = 2i ,你需要将它转换为 0+2i 的形式。\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre>\n<strong>输入:</strong>num1 = \"1+-1i\", num2 = \"1+-1i\"\n<strong>输出:</strong>\"0+-2i\"\n<strong>解释:</strong>(1 - i) * (1 - i) = 1 + i2 - 2 * i = -2i ,你需要将它转换为 0+-2i 的形式。 \n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>num1</code> 和 <code>num2</code> 都是有效的复数表示。</li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 134,
"likes": 135,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"39.8K\", \"totalSubmission\": \"53.1K\", \"totalAcceptedRaw\": 39816, \"totalSubmissionRaw\": 53140, \"acRate\": \"74.9%\"}",
"stats": "{\"totalAccepted\": \"40.1K\", \"totalSubmission\": \"53.5K\", \"totalAcceptedRaw\": 40099, \"totalSubmissionRaw\": 53533, \"acRate\": \"74.9%\"}",
"hints": [],
"solution": {
"id": "100",