coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-12 17:05:15 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-09-29 14:43:44 +08:00
parent 2862a227c4
commit 13f2098086
4409 changed files with 168933 additions and 166256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/problem (English)/设计路由器(English) [implement-router].html
View File

@@ -36,7 +36,7 @@
<li>Returns the number of packets currently stored in the router (i.e., not yet forwarded) that have the specified destination and have timestamps in the inclusive range <code>[startTime, endTime]</code>.</li>
</ul>
<p><strong>Note</strong> that queries for <code>addPacket</code> will be made in increasing order of <code>timestamp</code>.</p>
<p><strong>Note</strong> that queries for <code>addPacket</code> will be made in non-decreasing order of <code>timestamp</code>.</p>
<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
@@ -85,5 +85,5 @@ router.forwardPacket(); // There are no packets left, return <code>[]</code>.</d
<li><code>1 &lt;= timestamp &lt;= 10<sup>9</sup></code></li>
<li><code>1 &lt;= startTime &lt;= endTime &lt;= 10<sup>9</sup></code></li>
<li>At most <code>10<sup>5</sup></code> calls will be made to <code>addPacket</code>, <code>forwardPacket</code>, and <code>getCount</code> methods altogether.</li>
<li>queries for <code>addPacket</code> will be made in increasing order of <code>timestamp</code>.</li>
<li>queries for <code>addPacket</code> will be made in non-decreasing order of <code>timestamp</code>.</li>
</ul>