update

leetcode-cn/originData/maximum-product-of-three-numbers.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个整型数组 <code>nums</code> ，在数组中找出由三个数组成的最大乘积，并输出这个乘积。</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>6\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [1,2,3,4]\n<strong>输出：</strong>24\n</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [-1,-2,-3]\n<strong>输出：</strong>-6\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>3 <= nums.length <= 10<sup>4</sup></code></li>\n\t<li><code>-1000 <= nums[i] <= 1000</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 368,
+            "likes": 370,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Maximum Product Subarray\", \"titleSlug\": \"maximum-product-subarray\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u4e58\\u79ef\\u6700\\u5927\\u5b50\\u6570\\u7ec4\"}]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"90.1K\", \"totalSubmission\": \"171.8K\", \"totalAcceptedRaw\": 90083, \"totalSubmissionRaw\": 171774, \"acRate\": \"52.4%\"}",
+            "stats": "{\"totalAccepted\": \"90.2K\", \"totalSubmission\": \"172.1K\", \"totalAcceptedRaw\": 90234, \"totalSubmissionRaw\": 172074, \"acRate\": \"52.4%\"}",
             "hints": [],
             "solution": null,
             "status": null,