update

leetcode-cn/originData/gu-piao-de-zui-da-li-run-lcof.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>假设把某股票的价格按照时间先后顺序存储在数组中，请问买卖该股票一次可能获得的最大利润是多少？</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre><strong>输入:</strong> [7,1,5,3,6,4]\n<strong>输出:</strong> 5\n<strong>解释: </strong>在第 2 天（股票价格 = 1）的时候买入，在第 5 天（股票价格 = 6）的时候卖出，最大利润 = 6-1 = 5 。\n     注意利润不能是 7-1 = 6, 因为卖出价格需要大于买入价格。\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre><strong>输入:</strong> [7,6,4,3,1]\n<strong>输出:</strong> 0\n<strong>解释: </strong>在这种情况下, 没有交易完成, 所以最大利润为 0。</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>限制：</strong></p>\n\n<p><code>0 &lt;= 数组长度 &lt;= 10^5</code></p>\n\n<p>&nbsp;</p>\n\n<p><strong>注意：</strong>本题与主站 121 题相同：<a href=\"https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/\">https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/</a></p>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 233,
+            "likes": 240,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"182.9K\", \"totalSubmission\": \"288K\", \"totalAcceptedRaw\": 182872, \"totalSubmissionRaw\": 288042, \"acRate\": \"63.5%\"}",
+            "stats": "{\"totalAccepted\": \"192.5K\", \"totalSubmission\": \"303.2K\", \"totalAcceptedRaw\": 192510, \"totalSubmissionRaw\": 303163, \"acRate\": \"63.5%\"}",
             "hints": [],
             "solution": null,
             "status": null,