update

leetcode-cn/originData/bao-han-minhan-shu-de-zhan-lcof.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>定义栈的数据结构，请在该类型中实现一个能够得到栈的最小元素的 min 函数在该栈中，调用 min、push 及 pop 的时间复杂度都是 O(1)。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例:</strong></p>\n\n<pre>MinStack minStack = new MinStack();\nminStack.push(-2);\nminStack.push(0);\nminStack.push(-3);\nminStack.min();   --&gt; 返回 -3.\nminStack.pop();\nminStack.top();      --&gt; 返回 0.\nminStack.min();   --&gt; 返回 -2.\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ol>\n\t<li>各函数的调用总次数不超过 20000 次</li>\n</ol>\n\n<p>&nbsp;</p>\n\n<p>注意：本题与主站 155 题相同：<a href=\"https://leetcode-cn.com/problems/min-stack/\">https://leetcode-cn.com/problems/min-stack/</a></p>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 316,
+            "likes": 331,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"225.6K\", \"totalSubmission\": \"408.7K\", \"totalAcceptedRaw\": 225578, \"totalSubmissionRaw\": 408699, \"acRate\": \"55.2%\"}",
+            "stats": "{\"totalAccepted\": \"237.2K\", \"totalSubmission\": \"429.7K\", \"totalAcceptedRaw\": 237202, \"totalSubmissionRaw\": 429656, \"acRate\": \"55.2%\"}",
             "hints": [],
             "solution": null,
             "status": null,