mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-25 14:58:56 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给定一个整数数组 <code>A</code>,找出索引为 (i, j, k) 的三元组,使得:</p>\n\n<ul>\n\t<li><code>0 <= i < A.length</code></li>\n\t<li><code>0 <= j < A.length</code></li>\n\t<li><code>0 <= k < A.length</code></li>\n\t<li><code>A[i] & A[j] & A[k] == 0</code>,其中 <code>&</code> 表示按位与(AND)操作符。</li>\n</ul>\n\n<p> </p>\n\n<p><strong>示例:</strong></p>\n\n<pre><strong>输入:</strong>[2,1,3]\n<strong>输出:</strong>12\n<strong>解释:</strong>我们可以选出如下 i, j, k 三元组:\n(i=0, j=0, k=1) : 2 & 2 & 1\n(i=0, j=1, k=0) : 2 & 1 & 2\n(i=0, j=1, k=1) : 2 & 1 & 1\n(i=0, j=1, k=2) : 2 & 1 & 3\n(i=0, j=2, k=1) : 2 & 3 & 1\n(i=1, j=0, k=0) : 1 & 2 & 2\n(i=1, j=0, k=1) : 1 & 2 & 1\n(i=1, j=0, k=2) : 1 & 2 & 3\n(i=1, j=1, k=0) : 1 & 1 & 2\n(i=1, j=2, k=0) : 1 & 3 & 2\n(i=2, j=0, k=1) : 3 & 2 & 1\n(i=2, j=1, k=0) : 3 & 1 & 2\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ol>\n\t<li><code>1 <= A.length <= 1000</code></li>\n\t<li><code>0 <= A[i] < 2^16</code></li>\n</ol>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 40,
|
||||
"likes": 42,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"3K\", \"totalSubmission\": \"5.4K\", \"totalAcceptedRaw\": 3012, \"totalSubmissionRaw\": 5418, \"acRate\": \"55.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"5.5K\", \"totalAcceptedRaw\": 3067, \"totalSubmissionRaw\": 5497, \"acRate\": \"55.8%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
||||
Reference in New Issue
Block a user