1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 08:21:41 +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>将非负整数 <code>num</code> 转换为其对应的英文表示。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<pre>\n<strong>输入:</strong>num = 123\n<strong>输出:</strong>\"One Hundred Twenty Three\"\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre>\n<strong>输入:</strong>num = 12345\n<strong>输出:</strong>\"Twelve Thousand Three Hundred Forty Five\"\n</pre>\n\n<p><strong>示例 3</strong></p>\n\n<pre>\n<strong>输入:</strong>num = 1234567\n<strong>输出:</strong>\"One Million Two Hundred Thirty Four Thousand Five Hundred Sixty Seven\"\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>0 &lt;= num &lt;= 2<sup>31</sup> - 1</code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 265,
"likes": 268,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Integer to Roman\", \"titleSlug\": \"integer-to-roman\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u6574\\u6570\\u8f6c\\u7f57\\u9a6c\\u6570\\u5b57\"}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"31.7K\", \"totalSubmission\": \"86.7K\", \"totalAcceptedRaw\": 31669, \"totalSubmissionRaw\": 86732, \"acRate\": \"36.5%\"}",
"stats": "{\"totalAccepted\": \"32.2K\", \"totalSubmission\": \"88K\", \"totalAcceptedRaw\": 32175, \"totalSubmissionRaw\": 88022, \"acRate\": \"36.6%\"}",
"hints": [
"Did you see a pattern in dividing the number into chunk of words? For example, 123 and 123000.",
"Group the number by thousands (3 digits). You can write a helper function that takes a number less than 1000 and convert just that chunk to words.",