2022-03-27 20:46:41 +08:00
|
|
|
|
{
|
|
|
|
|
|
"data": {
|
|
|
|
|
|
"question": {
|
|
|
|
|
|
"questionId": "1062",
|
|
|
|
|
|
"questionFrontendId": "1013",
|
|
|
|
|
|
"categoryTitle": "Algorithms",
|
|
|
|
|
|
"boundTopicId": 3261,
|
|
|
|
|
|
"title": "Partition Array Into Three Parts With Equal Sum",
|
|
|
|
|
|
"titleSlug": "partition-array-into-three-parts-with-equal-sum",
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"content": "<p>Given an array of integers <code>arr</code>, return <code>true</code> if we can partition the array into three <strong>non-empty</strong> parts with equal sums.</p>\n\n<p>Formally, we can partition the array if we can find indexes <code>i + 1 < j</code> with <code>(arr[0] + arr[1] + ... + arr[i] == arr[i + 1] + arr[i + 2] + ... + arr[j - 1] == arr[j] + arr[j + 1] + ... + arr[arr.length - 1])</code></p>\n\n<p> </p>\n<p><strong class=\"example\">Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> arr = [0,2,1,-6,6,-7,9,1,2,0,1]\n<strong>Output:</strong> true\n<strong>Explanation: </strong>0 + 2 + 1 = -6 + 6 - 7 + 9 + 1 = 2 + 0 + 1\n</pre>\n\n<p><strong class=\"example\">Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> arr = [0,2,1,-6,6,7,9,-1,2,0,1]\n<strong>Output:</strong> false\n</pre>\n\n<p><strong class=\"example\">Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> arr = [3,3,6,5,-2,2,5,1,-9,4]\n<strong>Output:</strong> true\n<strong>Explanation: </strong>3 + 3 = 6 = 5 - 2 + 2 + 5 + 1 - 9 + 4\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>3 <= arr.length <= 5 * 10<sup>4</sup></code></li>\n\t<li><code>-10<sup>4</sup> <= arr[i] <= 10<sup>4</sup></code></li>\n</ul>\n",
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"translatedTitle": "将数组分成和相等的三个部分",
|
|
|
|
|
|
"translatedContent": "<p>给你一个整数数组 <code>arr</code>，只有可以将其划分为三个和相等的 <strong>非空</strong> 部分时才返回 <code>true</code>，否则返回 <code>false</code>。</p>\n\n<p>形式上，如果可以找出索引 <code>i + 1 < j</code> 且满足 <code>(arr[0] + arr[1] + ... + arr[i] == arr[i + 1] + arr[i + 2] + ... + arr[j - 1] == arr[j] + arr[j + 1] + ... + arr[arr.length - 1])</code> 就可以将数组三等分。</p>\n\n<p> </p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>arr = [0,2,1,-6,6,-7,9,1,2,0,1]\n<strong>输出：</strong>true\n<strong>解释：</strong>0 + 2 + 1 = -6 + 6 - 7 + 9 + 1 = 2 + 0 + 1\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>arr = [0,2,1,-6,6,7,9,-1,2,0,1]\n<strong>输出：</strong>false\n</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<pre>\n<strong>输入：</strong>arr = [3,3,6,5,-2,2,5,1,-9,4]\n<strong>输出：</strong>true\n<strong>解释：</strong>3 + 3 = 6 = 5 - 2 + 2 + 5 + 1 - 9 + 4\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>3 <= arr.length <= 5 * 10<sup>4</sup></code></li>\n\t<li><code>-10<sup>4</sup> <= arr[i] <= 10<sup>4</sup></code></li>\n</ul>\n",
|
|
|
|
|
|
"isPaidOnly": false,
|
|
|
|
|
|
"difficulty": "Easy",
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"likes": 205,
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"dislikes": 0,
|
|
|
|
|
|
"isLiked": null,
|
|
|
|
|
|
"similarQuestions": "[]",
|
|
|
|
|
|
"contributors": [],
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"topicTags": [
|
|
|
|
|
|
{
|
|
|
|
|
|
"name": "Greedy",
|
|
|
|
|
|
"slug": "greedy",
|
|
|
|
|
|
"translatedName": "贪心",
|
|
|
|
|
|
"__typename": "TopicTagNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
|
|
|
|
|
"name": "Array",
|
|
|
|
|
|
"slug": "array",
|
|
|
|
|
|
"translatedName": "数组",
|
|
|
|
|
|
"__typename": "TopicTagNode"
|
|
|
|
|
|
}
|
|
|
|
|
|
],
|
|
|
|
|
|
"companyTagStats": null,
|
|
|
|
|
|
"codeSnippets": [
|
|
|
|
|
|
{
|
|
|
|
|
|
"lang": "C++",
|
|
|
|
|
|
"langSlug": "cpp",
|
|
|
|
|
|
"code": "class Solution {\npublic:\n bool canThreePartsEqualSum(vector<int>& arr) {\n\n }\n};",
|
|
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
|
|
|
|
|
"lang": "Java",
|
|
|
|
|
|
"langSlug": "java",
|
|
|
|
|
|
"code": "class Solution {\n public boolean canThreePartsEqualSum(int[] arr) {\n\n }\n}",
|
|
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
|
|
|
|
|
"lang": "Python",
|
|
|
|
|
|
"langSlug": "python",
|
|
|
|
|
|
"code": "class Solution(object):\n def canThreePartsEqualSum(self, arr):\n \"\"\"\n :type arr: List[int]\n :rtype: bool\n \"\"\"",
|
|
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
|
|
|
|
|
"lang": "Python3",
|
|
|
|
|
|
"langSlug": "python3",
|
|
|
|
|
|
"code": "class Solution:\n def canThreePartsEqualSum(self, arr: List[int]) -> bool:",
|
|
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
|
|
|
|
|
"lang": "C",
|
|
|
|
|
|
"langSlug": "c",
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"code": "bool canThreePartsEqualSum(int* arr, int arrSize) {\n \n}",
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
|
|
|
|
|
"lang": "C#",
|
|
|
|
|
|
"langSlug": "csharp",
|
|
|
|
|
|
"code": "public class Solution {\n public bool CanThreePartsEqualSum(int[] arr) {\n\n }\n}",
|
|
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
|
|
|
|
|
"lang": "JavaScript",
|
|
|
|
|
|
"langSlug": "javascript",
|
|
|
|
|
|
"code": "/**\n * @param {number[]} arr\n * @return {boolean}\n */\nvar canThreePartsEqualSum = function(arr) {\n\n};",
|
|
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"lang": "TypeScript",
|
|
|
|
|
|
"langSlug": "typescript",
|
|
|
|
|
|
"code": "function canThreePartsEqualSum(arr: number[]): boolean {\n \n};",
|
|
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
|
|
|
|
|
"lang": "PHP",
|
|
|
|
|
|
"langSlug": "php",
|
|
|
|
|
|
"code": "class Solution {\n\n /**\n * @param Integer[] $arr\n * @return Boolean\n */\n function canThreePartsEqualSum($arr) {\n\n }\n}",
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
|
|
|
|
|
"lang": "Swift",
|
|
|
|
|
|
"langSlug": "swift",
|
|
|
|
|
|
"code": "class Solution {\n func canThreePartsEqualSum(_ arr: [Int]) -> Bool {\n\n }\n}",
|
|
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"lang": "Kotlin",
|
|
|
|
|
|
"langSlug": "kotlin",
|
|
|
|
|
|
"code": "class Solution {\n fun canThreePartsEqualSum(arr: IntArray): Boolean {\n\n }\n}",
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"lang": "Dart",
|
|
|
|
|
|
"langSlug": "dart",
|
|
|
|
|
|
"code": "class Solution {\n bool canThreePartsEqualSum(List<int> arr) {\n \n }\n}",
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"lang": "Go",
|
|
|
|
|
|
"langSlug": "golang",
|
|
|
|
|
|
"code": "func canThreePartsEqualSum(arr []int) bool {\n\n}",
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"lang": "Ruby",
|
|
|
|
|
|
"langSlug": "ruby",
|
|
|
|
|
|
"code": "# @param {Integer[]} arr\n# @return {Boolean}\ndef can_three_parts_equal_sum(arr)\n\nend",
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"lang": "Scala",
|
|
|
|
|
|
"langSlug": "scala",
|
|
|
|
|
|
"code": "object Solution {\n def canThreePartsEqualSum(arr: Array[Int]): Boolean = {\n\n }\n}",
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"lang": "Rust",
|
|
|
|
|
|
"langSlug": "rust",
|
|
|
|
|
|
"code": "impl Solution {\n pub fn can_three_parts_equal_sum(arr: Vec<i32>) -> bool {\n\n }\n}",
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
|
|
|
|
|
"lang": "Racket",
|
|
|
|
|
|
"langSlug": "racket",
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"code": "(define/contract (can-three-parts-equal-sum arr)\n (-> (listof exact-integer?) boolean?)\n )",
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
|
|
|
|
|
"lang": "Erlang",
|
|
|
|
|
|
"langSlug": "erlang",
|
|
|
|
|
|
"code": "-spec can_three_parts_equal_sum(Arr :: [integer()]) -> boolean().\ncan_three_parts_equal_sum(Arr) ->\n .",
|
|
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
},
|
|
|
|
|
|
{
|
|
|
|
|
|
"lang": "Elixir",
|
|
|
|
|
|
"langSlug": "elixir",
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"code": "defmodule Solution do\n @spec can_three_parts_equal_sum(arr :: [integer]) :: boolean\n def can_three_parts_equal_sum(arr) do\n \n end\nend",
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"__typename": "CodeSnippetNode"
|
|
|
|
|
|
}
|
|
|
|
|
|
],
|
2023-12-09 19:57:46 +08:00
|
|
|
|
"stats": "{\"totalAccepted\": \"62.2K\", \"totalSubmission\": \"161.6K\", \"totalAcceptedRaw\": 62179, \"totalSubmissionRaw\": 161635, \"acRate\": \"38.5%\"}",
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"hints": [
|
|
|
|
|
|
"If we have three parts with the same sum, what is the sum of each?\r\nIf you can find the first part, can you find the second part?"
|
|
|
|
|
|
],
|
|
|
|
|
|
"solution": null,
|
|
|
|
|
|
"status": null,
|
|
|
|
|
|
"sampleTestCase": "[0,2,1,-6,6,-7,9,1,2,0,1]",
|
|
|
|
|
|
"metaData": "{\n \"name\": \"canThreePartsEqualSum\",\n \"params\": [\n {\n \"name\": \"arr\",\n \"type\": \"integer[]\"\n }\n ],\n \"return\": {\n \"type\": \"boolean\"\n }\n}",
|
|
|
|
|
|
"judgerAvailable": true,
|
|
|
|
|
|
"judgeType": "large",
|
|
|
|
|
|
"mysqlSchemas": [],
|
|
|
|
|
|
"enableRunCode": true,
|
2023-12-09 18:42:21 +08:00
|
|
|
|
"envInfo": "{\"cpp\":[\"C++\",\"<p>\\u7248\\u672c\\uff1a<code>clang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\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\\u7528GNU11\\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
|
2022-03-27 20:46:41 +08:00
|
|
|
|
"book": null,
|
|
|
|
|
|
"isSubscribed": false,
|
|
|
|
|
|
"isDailyQuestion": false,
|
|
|
|
|
|
"dailyRecordStatus": null,
|
|
|
|
|
|
"editorType": "CKEDITOR",
|
|
|
|
|
|
"ugcQuestionId": null,
|
|
|
|
|
|
"style": "LEETCODE",
|
|
|
|
|
|
"exampleTestcases": "[0,2,1,-6,6,-7,9,1,2,0,1]\n[0,2,1,-6,6,7,9,-1,2,0,1]\n[3,3,6,5,-2,2,5,1,-9,4]",
|
|
|
|
|
|
"__typename": "QuestionNode"
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
