mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-02-19 05:15:20 +08:00
171 lines
21 KiB
JSON
171 lines
21 KiB
JSON
|
{
|
|||
|
"data": {
|
|||
|
"question": {
|
|||
|
"questionId": "1517",
|
|||
|
"questionFrontendId": "1416",
|
|||
|
"categoryTitle": "Algorithms",
|
|||
|
"boundTopicId": 204487,
|
|||
|
"title": "Restore The Array",
|
|||
|
"titleSlug": "restore-the-array",
|
|||
|
"content": "<p>A program was supposed to print an array of integers. The program forgot to print whitespaces and the array is printed as a string of digits <code>s</code> and all we know is that all integers in the array were in the range <code>[1, k]</code> and there are no leading zeros in the array.</p>\n\n<p>Given the string <code>s</code> and the integer <code>k</code>, return <em>the number of the possible arrays that can be printed as </em><code>s</code><em> using the mentioned program</em>. Since the answer may be very large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>\n\n<p> </p>\n<p><strong>Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "1000", k = 10000\n<strong>Output:</strong> 1\n<strong>Explanation:</strong> The only possible array is [1000]\n</pre>\n\n<p><strong>Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "1000", k = 10\n<strong>Output:</strong> 0\n<strong>Explanation:</strong> There cannot be an array that was printed this way and has all integer >= 1 and <= 10.\n</pre>\n\n<p><strong>Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> s = "1317", k = 2000\n<strong>Output:</strong> 8\n<strong>Explanation:</strong> Possible arrays are [1317],[131,7],[13,17],[1,317],[13,1,7],[1,31,7],[1,3,17],[1,3,1,7]\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 10<sup>5</sup></code></li>\n\t<li><code>s</code> consists of only digits and does not contain leading zeros.</li>\n\t<li><code>1 <= k <= 10<sup>9</sup></code></li>\n</ul>\n",
|
|||
|
"translatedTitle": "恢复数组",
|
|||
|
"translatedContent": "<p>某个程序本来应该输出一个整数数组。但是这个程序忘记输出空格了以致输出了一个数字字符串,我们所知道的信息只有:数组中所有整数都在 <code>[1, k]</code> 之间,且数组中的数字都没有前导 0 。</p>\n\n<p>给你字符串 <code>s</code> 和整数 <code>k</code> 。可能会有多种不同的数组恢复结果。</p>\n\n<p>按照上述程序,请你返回所有可能输出字符串 <code>s</code> 的数组方案数。</p>\n\n<p>由于数组方案数可能会很大,请你返回它对 <code>10^9 + 7</code> <strong>取余</strong> 后的结果。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre><strong>输入:</strong>s = "1000", k = 10000\n<strong>输出:</strong>1\n<strong>解释:</strong>唯一一种可能的数组方案是 [1000]\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre><strong>输入:</strong>s = "1000", k = 10\n<strong>输出:</strong>0\n<strong>解释:</strong>不存在任何数组方案满足所有整数都 >= 1 且 <= 10 同时输出结果为 s 。\n</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre><strong>输入:</strong>s = "1317", k = 2000\n<strong>输出:</strong>8\n<strong>解释:</strong>可行的数组方案为 [1317],[131,7],[13,17],[1,317],[13,1,7],[1,31,7],[1,3,17],[1,3,1,7]\n</pre>\n\n<p><strong>示例 4:</strong></p>\n\n<pre><strong>输入:</strong>s = "2020", k = 30\n<strong>输出:</strong>1\n<strong>解释:</strong>唯一可能的数组方案是 [20,20] 。 [2020] 不是可行的数组方案,原因是 2020 > 30 。 [2,020] 也不是可行的数组方案,因为 020 含有前导 0 。\n</pre>\n\n<p><strong>示例 5:</strong></p>\n\n<pre><strong>输入:</strong>s = "1234567890", k = 90\n<strong>输出:</strong>34\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 10^5</code>.</li>\n\t<li><code>s</code> 只包含数字且不包含前导 0 。</li>\n\t<li><code>1 <= k <= 10^9</code>.</li>\n</ul>\n",
|
|||
|
"isPaidOnly": false,
|
|||
|
"difficulty": "Hard",
|
|||
|
"likes": 45,
|
|||
|
"dislikes": 0,
|
|||
|
"isLiked": null,
|
|||
|
"similarQuestions": "[]",
|
|||
|
"contributors": [],
|
|||
|
"langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false}",
|
|||
|
"topicTags": [
|
|||
|
{
|
|||
|
"name": "String",
|
|||
|
"slug": "string",
|
|||
|
"translatedName": "字符串",
|
|||
|
"__typename": "TopicTagNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"name": "Dynamic Programming",
|
|||
|
"slug": "dynamic-programming",
|
|||
|
"translatedName": "动态规划",
|
|||
|
"__typename": "TopicTagNode"
|
|||
|
}
|
|||
|
],
|
|||
|
"companyTagStats": null,
|
|||
|
"codeSnippets": [
|
|||
|
{
|
|||
|
"lang": "C++",
|
|||
|
"langSlug": "cpp",
|
|||
|
"code": "class Solution {\npublic:\n int numberOfArrays(string s, int k) {\n\n }\n};",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "Java",
|
|||
|
"langSlug": "java",
|
|||
|
"code": "class Solution {\n public int numberOfArrays(String s, int k) {\n\n }\n}",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "Python",
|
|||
|
"langSlug": "python",
|
|||
|
"code": "class Solution(object):\n def numberOfArrays(self, s, k):\n \"\"\"\n :type s: str\n :type k: int\n :rtype: int\n \"\"\"",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "Python3",
|
|||
|
"langSlug": "python3",
|
|||
|
"code": "class Solution:\n def numberOfArrays(self, s: str, k: int) -> int:",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "C",
|
|||
|
"langSlug": "c",
|
|||
|
"code": "\n\nint numberOfArrays(char * s, int k){\n\n}",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "C#",
|
|||
|
"langSlug": "csharp",
|
|||
|
"code": "public class Solution {\n public int NumberOfArrays(string s, int k) {\n\n }\n}",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "JavaScript",
|
|||
|
"langSlug": "javascript",
|
|||
|
"code": "/**\n * @param {string} s\n * @param {number} k\n * @return {number}\n */\nvar numberOfArrays = function(s, k) {\n\n};",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "Ruby",
|
|||
|
"langSlug": "ruby",
|
|||
|
"code": "# @param {String} s\n# @param {Integer} k\n# @return {Integer}\ndef number_of_arrays(s, k)\n\nend",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "Swift",
|
|||
|
"langSlug": "swift",
|
|||
|
"code": "class Solution {\n func numberOfArrays(_ s: String, _ k: Int) -> Int {\n\n }\n}",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "Go",
|
|||
|
"langSlug": "golang",
|
|||
|
"code": "func numberOfArrays(s string, k int) int {\n\n}",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "Scala",
|
|||
|
"langSlug": "scala",
|
|||
|
"code": "object Solution {\n def numberOfArrays(s: String, k: Int): Int = {\n\n }\n}",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "Kotlin",
|
|||
|
"langSlug": "kotlin",
|
|||
|
"code": "class Solution {\n fun numberOfArrays(s: String, k: Int): Int {\n\n }\n}",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "Rust",
|
|||
|
"langSlug": "rust",
|
|||
|
"code": "impl Solution {\n pub fn number_of_arrays(s: String, k: i32) -> i32 {\n\n }\n}",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "PHP",
|
|||
|
"langSlug": "php",
|
|||
|
"code": "class Solution {\n\n /**\n * @param String $s\n * @param Integer $k\n * @return Integer\n */\n function numberOfArrays($s, $k) {\n\n }\n}",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "TypeScript",
|
|||
|
"langSlug": "typescript",
|
|||
|
"code": "function numberOfArrays(s: string, k: number): number {\n\n};",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "Racket",
|
|||
|
"langSlug": "racket",
|
|||
|
"code": "(define/contract (number-of-arrays s k)\n (-> string? exact-integer? exact-integer?)\n\n )",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "Erlang",
|
|||
|
"langSlug": "erlang",
|
|||
|
"code": "-spec number_of_arrays(S :: unicode:unicode_binary(), K :: integer()) -> integer().\nnumber_of_arrays(S, K) ->\n .",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
},
|
|||
|
{
|
|||
|
"lang": "Elixir",
|
|||
|
"langSlug": "elixir",
|
|||
|
"code": "defmodule Solution do\n @spec number_of_arrays(s :: String.t, k :: integer) :: integer\n def number_of_arrays(s, k) do\n\n end\nend",
|
|||
|
"__typename": "CodeSnippetNode"
|
|||
|
}
|
|||
|
],
|
|||
|
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 3089, \"totalSubmissionRaw\": 7468, \"acRate\": \"41.4%\"}",
|
|||
|
"hints": [
|
|||
|
"Use dynamic programming. Build an array dp where dp[i] is the number of ways you can divide the string starting from index i to the end.",
|
|||
|
"Keep in mind that the answer is modulo 10^9 + 7 and take the mod for each operation."
|
|||
|
],
|
|||
|
"solution": null,
|
|||
|
"status": null,
|
|||
|
"sampleTestCase": "\"1000\"\n10000",
|
|||
|
"metaData": "{\n \"name\": \"numberOfArrays\",\n \"params\": [\n {\n \"name\": \"s\",\n \"type\": \"string\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"k\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}",
|
|||
|
"judgerAvailable": true,
|
|||
|
"judgeType": "large",
|
|||
|
"mysqlSchemas": [],
|
|||
|
"enableRunCode": true,
|
|||
|
"envInfo": "{\"cpp\":[\"C++\",\"<p>\\u7248\\u672c\\uff1a<code>clang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n<p>\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528<code>-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002<a href=\\\"https:\\/\\/github.com\\/google\\/sanitizers\\/wiki\\/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b<code>out-of-bounds<\\/code>\\u548c<code>use-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n<p>\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"<p>\\u7248\\u672c\\uff1a<code>OpenJDK 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/p>\\r\\n\\r\\n<p>\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n<p>\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"<p>\\u7248\\u672c\\uff1a <code>Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n<p>\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1a<a href=\\\"https:\\/\\/docs.python.org\\/2\\/library\\/array.html\\\" target=\\\"_blank\\\">array<\\/a>, <a href=\\\"https:\\/\\/docs.python.org\\/2\\/library\\/bisect.html\\\" target=\\\"_blank\\\">bisect<\\/a>, <a href=\\\"https:\\/\\/docs.python.org\\/2\\/library\\/collections.html\\\" target=\\\"_blank\\\">collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n<p>\\u6ce8\\u610f Python 2.7 <a href=\\\"https:\\/\\/www.python.org\\/dev\\/peps\\/pep-0373\\/\\\" target=\\\"_blank\\\">\\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"<p>\\u7248\\u672c\\uff1a<code>GCC 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU99\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n<p>\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528<code>-O1<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 <a href=\\\"https:\\/\\/github.com\\/google\\/sanitizers\\/wiki\\/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4b<code>out-of-bounds<\\/code>\\u548c<code>use-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n<p>\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n<p>\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 <a href=\\\"https:\\/\\/troydhanson.github.io\\/uthash\\/\\\" target=\\\"_blank\\\">uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n<p><b>1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n<pre>\\r\\nstruct hash_entry {\\r\\n int id; \\/* we'll use this field as the key *\\/\\r\\n char name[10];\\r\\n UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n<p><b>2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n<pre>\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n re
|
|||
|
"book": null,
|
|||
|
"isSubscribed": false,
|
|||
|
"isDailyQuestion": false,
|
|||
|
"dailyRecordStatus": null,
|
|||
|
"editorType": "CKEDITOR",
|
|||
|
"ugcQuestionId": null,
|
|||
|
"style": "LEETCODE",
|
|||
|
"exampleTestcases": "\"1000\"\n10000\n\"1000\"\n10\n\"1317\"\n2000",
|
|||
|
"__typename": "QuestionNode"
|
|||
|
}
|
|||
|
}
|
|||
|
}
|