mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
存量题库数据更新
This commit is contained in:
@@ -14,7 +14,7 @@
|
||||
<p>Return <em>the <b>number of valid ways</b> to select 3 buildings.</em></p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "001101"
|
||||
@@ -30,7 +30,7 @@ The following sets of indices selected are valid:
|
||||
No other selection is valid. Thus, there are 6 total ways.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> s = "11100"
|
||||
|
Reference in New Issue
Block a user