update

leetcode-cn/originData/min-stack-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>请设计一个栈，除了常规栈支持的pop与push函数以外，还支持min函数，该函数返回栈元素中的最小值。执行push、pop和min操作的时间复杂度必须为O(1)。</p><br><p><strong>示例：</strong><pre>MinStack minStack = new MinStack();<br>minStack.push(-2);<br>minStack.push(0);<br>minStack.push(-3);<br>minStack.getMin();   --> 返回 -3.<br>minStack.pop();<br>minStack.top();      --> 返回 0.<br>minStack.getMin();   --> 返回 -2.</pre></p>",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 71,
+            "likes": 73,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"30.7K\", \"totalSubmission\": \"49.8K\", \"totalAcceptedRaw\": 30672, \"totalSubmissionRaw\": 49769, \"acRate\": \"61.6%\"}",
+            "stats": "{\"totalAccepted\": \"31.4K\", \"totalSubmission\": \"51.1K\", \"totalAcceptedRaw\": 31447, \"totalSubmissionRaw\": 51077, \"acRate\": \"61.6%\"}",
             "hints": [
                 "注意最小的元素不会经常变化。它只在添加更小的元素或最小的元素被弹出时才发生变化。",
                 "如果保持追踪每个栈节点的额外数据会怎么样？什么样的数据可能更容易解决这个问题呢？",