mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -29,5 +29,6 @@ n = -2
|
||||
|
||||
<ul>
|
||||
<li><code>-1000<sup> </sup><= n <= 1000</code></li>
|
||||
<li><code>At most 1000 calls to counter() will be made</code></li>
|
||||
<li><code>0 <= calls.length <= 1000</code></li>
|
||||
<li><code>calls[i] === "call"</code></li>
|
||||
</ul>
|
||||
|
Reference in New Issue
Block a user