LeetCode每日一题(2222. Number of Ways to Select Buildings)

You are given a 0-indexed binary string s which represents the types of buildings along a street where:

s[i] = ‘0’ denotes that the ith building is an office and
s[i] = ‘1’ denotes that the ith building is a restaurant.
As a city official, you would like to select 3 buildings for random inspection. However, to ensure variety, no two consecutive buildings out of the selected buildings can be of the same type.

For example, given s = “001101”, we cannot select the 1st, 3rd, and 5th buildings as that would form “011” which is not allowed due to having two consecutive buildings of the same type.
Return the number of valid ways to select 3 buildings.

Example 1:

Input: s = “001101”
Output: 6

Explanation:
The following sets of indices selected are valid:

• [0,2,4] from “001101” forms “010”
• [0,3,4] from “001101” forms “010”
• [1,2,4] from “001101” forms “010”
• [1,3,4] from “001101” forms “010”
• [2,4,5] from “001101” forms “101”
• [3,4,5] from “001101” forms “101”
  No other selection is valid. Thus, there are 6 total ways.
  Example 2:

Input: s = “11100”
Output: 0

Explanation: It can be shown that there are no valid selections.

Constraints:

• 3 <= s.length <= 105
• s[i] is either ‘0’ or ‘1’.

---

遍历整条街， 如果 s[i] == 1, 那可能的组合是 s[0…i]中所有的 0 和 s[i+1…]中所有的 0 与 s[i]的组合， s[i] == 0 的情况与此相同， 只不过是 s[0…i]中所有的 1 和 s[i+1…]中所有的 1 与 s[i]的组合。我们现在要做的只是提前把每个 s[i]左边的 0 和 1 以及右边的 0 和 1 的数量都统计出来。

---

impl Solution {
   
    pub fn number_of_ways(s: String) ->