update

leetcode-cn/originData/largest-divisible-subset.json

@@ -12,7 +12,7 @@
             "translatedContent": "给你一个由 <strong>无重复</strong> 正整数组成的集合 <code>nums</code> ，请你找出并返回其中最大的整除子集 <code>answer</code> ，子集中每一元素对 <code>(answer[i], answer[j])</code> 都应当满足：\n<ul>\n\t<li><code>answer[i] % answer[j] == 0</code> ，或</li>\n\t<li><code>answer[j] % answer[i] == 0</code></li>\n</ul>\n\n<p>如果存在多个有效解子集，返回其中任何一个均可。</p>\n\n<p> </p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [1,2,3]\n<strong>输出：</strong>[1,2]\n<strong>解释：</strong>[1,3] 也会被视为正确答案。\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [1,2,4,8]\n<strong>输出：</strong>[1,2,4,8]\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 1000</code></li>\n\t<li><code>1 <= nums[i] <= 2 * 10<sup>9</sup></code></li>\n\t<li><code>nums</code> 中的所有整数 <strong>互不相同</strong></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 434,
+            "likes": 436,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"46.5K\", \"totalSubmission\": \"101.2K\", \"totalAcceptedRaw\": 46527, \"totalSubmissionRaw\": 101180, \"acRate\": \"46.0%\"}",
+            "stats": "{\"totalAccepted\": \"47.4K\", \"totalSubmission\": \"103.1K\", \"totalAcceptedRaw\": 47381, \"totalSubmissionRaw\": 103059, \"acRate\": \"46.0%\"}",
             "hints": [],
             "solution": null,
             "status": null,