coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/problem/find-good-days-to-rob-the-bank.html
View File

@@ -13,7 +13,7 @@
<p>Return <em>a list of <strong>all</strong> days <strong>(0-indexed) </strong>that are good days to rob the bank</em>.<em> The order that the days are returned in does<strong> </strong><strong>not</strong> matter.</em></p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> security = [5,3,3,3,5,6,2], time = 2
@@ -24,7 +24,7 @@ On day 3, we have security[1] &gt;= security[2] &gt;= security[3] &lt;= security
No other days satisfy this condition, so days 2 and 3 are the only good days to rob the bank.
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> security = [1,1,1,1,1], time = 0
@@ -33,7 +33,7 @@ No other days satisfy this condition, so days 2 and 3 are the only good days to
Since time equals 0, every day is a good day to rob the bank, so return every day.
</pre>
<p><strong>Example 3:</strong></p>
<p><strong class="example">Example 3:</strong></p>
<pre>
<strong>Input:</strong> security = [1,2,3,4,5,6], time = 2