coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 19:01:47 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
leetcode-cn/problem (Chinese)/最小栈 [bao-han-minhan-shu-de-zhan-lcof].html
View File

@@ -14,15 +14,15 @@
<p>&nbsp;</p>
<p><strong>示例 1:</strong></p>
<p><strong>示例 1：</strong></p>
<pre>
<strong>输入：</strong>
["MinStack","push","push","push","getMin","pop","top","getMin"]
[[],[-2],[2],[-3],[],[],[],[]]
[[],[-2],[0],[-3],[],[],[],[]]
<strong>输出：</strong>
[null,null,null,null,-3,null,2,-2]
[null,null,null,null,-3,null,0,-2]
<strong>解释：</strong>
MinStack minStack = new MinStack();
@@ -31,7 +31,7 @@ minStack.push(2);
minStack.push(-3);
minStack.getMin(); &nbsp; --&gt; 返回 -3.
minStack.pop();
minStack.top(); &nbsp; &nbsp; &nbsp;--&gt; 返回 2.
minStack.top(); &nbsp; &nbsp; &nbsp;--&gt; 返回 0.
minStack.getMin(); &nbsp; --&gt; 返回 -2.
</pre>