mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
67 lines
9.4 KiB
JSON
67 lines
9.4 KiB
JSON
|
{
|
|||
|
|
"data": {
|
|||
|
|
"question": {
|
|||
|
|
"questionId": "2297",
|
|||
|
|
"questionFrontendId": "2158",
|
|||
|
|
"boundTopicId": null,
|
|||
|
|
"title": "Amount of New Area Painted Each Day",
|
|||
|
|
"titleSlug": "amount-of-new-area-painted-each-day",
|
|||
|
|
"content": null,
|
|||
|
|
"translatedTitle": null,
|
|||
|
|
"translatedContent": null,
|
|||
|
|
"isPaidOnly": true,
|
|||
|
|
"difficulty": "Hard",
|
|||
|
|
"likes": 51,
|
|||
|
|
"dislikes": 7,
|
|||
|
|
"isLiked": null,
|
|||
|
|
"similarQuestions": "[{\"title\": \"Merge Intervals\", \"titleSlug\": \"merge-intervals\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Describe the Painting\", \"titleSlug\": \"describe-the-painting\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Average Height of Buildings in Each Segment\", \"titleSlug\": \"average-height-of-buildings-in-each-segment\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
|||
|
|
"exampleTestcases": "[[1,4],[4,7],[5,8]]\n[[1,4],[5,8],[4,7]]\n[[1,5],[2,4]]",
|
|||
|
|
"categoryTitle": "Algorithms",
|
|||
|
|
"contributors": [],
|
|||
|
|
"topicTags": [
|
|||
|
|
{
|
|||
|
|
"name": "Array",
|
|||
|
|
"slug": "array",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"name": "Segment Tree",
|
|||
|
|
"slug": "segment-tree",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"name": "Ordered Set",
|
|||
|
|
"slug": "ordered-set",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
}
|
|||
|
|
],
|
|||
|
|
"companyTagStats": null,
|
|||
|
|
"codeSnippets": null,
|
|||
|
|
"stats": "{\"totalAccepted\": \"2.3K\", \"totalSubmission\": \"3.7K\", \"totalAcceptedRaw\": 2269, \"totalSubmissionRaw\": 3744, \"acRate\": \"60.6%\"}",
|
|||
|
|
"hints": [
|
|||
|
|
"What’s a good way to keep track of intervals that you have already painted?",
|
|||
|
|
"Create an array of all 1’s, and when you have painted an interval, set the values in that interval to 0.",
|
|||
|
|
"Using this array, how can you quickly calculate the amount of new area that you paint on a given day?",
|
|||
|
|
"Calculate the sum of the new array in the interval that you paint."
|
|||
|
|
],
|
|||
|
|
"solution": null,
|
|||
|
|
"status": null,
|
|||
|
|
"sampleTestCase": "[[1,4],[4,7],[5,8]]",
|
|||
|
|
"metaData": "{\n \"name\": \"amountPainted\",\n \"params\": [\n {\n \"name\": \"paint\",\n \"type\": \"integer[][]\"\n }\n ],\n \"return\": {\n \"type\": \"integer[]\"\n }\n}",
|
|||
|
|
"judgerAvailable": true,
|
|||
|
|
"judgeType": "large",
|
|||
|
|
"mysqlSchemas": [],
|
|||
|
|
"enableRunCode": true,
|
|||
|
|
"enableTestMode": false,
|
|||
|
|
"enableDebugger": true,
|
|||
|
|
"envInfo": "{\"cpp\": [\"C++\", \"<p>Compiled with <code> clang 11 </code> using the latest C++ 17 standard.</p>\\r\\n\\r\\n<p>Your code is compiled with level two optimization (<code>-O2</code>). <a href=\\\"https://github.com/google/sanitizers/wiki/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\"], \"java\": [\"Java\", \"<p><code> OpenJDK 17 </code>. Java 8 features such as lambda expressions and stream API can be used. </p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\\r\\n<p>Includes <code>Pair</code> class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.</p>\"], \"python\": [\"Python\", \"<p><code>Python 2.7.12</code>.</p>\\r\\n\\r\\n<p>Most libraries are already imported automatically for your convenience, such as <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>. If you need more libraries, you can import it yourself.</p>\\r\\n\\r\\n<p>For Map/TreeMap data structure, you may use <a href=\\\"http://www.grantjenks.com/docs/sortedcontainers/\\\" target=\\\"_blank\\\">sortedcontainers</a> library.</p>\\r\\n\\r\\n<p>Note that Python 2.7 <a href=\\\"https://www.python.org/dev/peps/pep-0373/\\\" target=\\\"_blank\\\">will not be maintained past 2020</a>. For the latest Python, please choose Python3 instead.</p>\"], \"c\": [\"C\", \"<p>Compiled with <code>gcc 8.2</code> using the gnu99 standard.</p>\\r\\n\\r\\n<p>Your code is compiled with level one optimization (<code>-O1</code>). <a href=\\\"https://github.com/google/sanitizers/wiki/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\\r\\n\\r\\n<p>For hash table operations, you may use <a href=\\\"https://troydhanson.github.io/uthash/\\\" target=\\\"_blank\\\">uthash</a>. \\\"uthash.h\\\" is included by default. Below are some examples:</p>\\r\\n\\r\\n<p><b>1. Adding an item to a hash.</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. Looking up an item in a hash:</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 return s;\\r\\n}\\r\\n</pre>\\r\\n</p>\\r\\n\\r\\n<p><b>3. Deleting an item in a hash:</b>\\r\\n<pre>\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n</pre>\\r\\n</p>\"], \"csharp\": [\"C#\", \"<p><a href=\\\"https://docs.microsoft.com/en-us/dotnet/csharp/whats-new/csharp-9\\\" target=\\\"_blank\\\">C# 10 with .NET 6 runtime</a></p>\\r\\n\\r\\n<p>Your code is compiled with debug flag enabled (<code>/debug</code>).</p>\"], \"javascript\": [\"JavaScript\", \"<p><code>Node.js 16.13.2</code>.</p>\\r\\n\\r\\n<p>Your code is run with <code>--harmony</code> flag, enabling <a href=\\\"http://node.green/\\\" target=\\\"_blank\\\">new ES6 features</a>.</p>\\r\\n\\r\\n<p><a href=\\\"https://lodash.com\\\" target=\\\"_blank\\\">lodash.js</a> library is included by default.</p>\\r\\n\\r\\n<p>For Priority Queue / Queue data structures, you may use <a href=\\\"https://github.com/datastructures-js/priority-queue\\\" target=\\\"_blank\\\">datastructures-js/priority-queue</a> and <a href=\\\"https:
|
|||
|
|
"libraryUrl": null,
|
|||
|
|
"adminUrl": null,
|
|||
|
|
"challengeQuestion": null,
|
|||
|
|
"__typename": "QuestionNode"
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|