A. Erasing Zeroes

A. Erasing Zeroes

---

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output

You are given a string s. Each character is either 0 or 1.

You want all 1’s in the string to form a contiguous subsegment. For example, if the string is 0, 1, 00111 or 01111100, then all 1’s form a contiguous subsegment, and if the string is 0101, 100001 or 11111111111101, then this condition is not met.

You may erase some (possibly none) 0’s from the string. What is the minimum number of 0’s that you have to erase?

Input
The first line contains one integer t (1≤t≤100) — the number of test cases.

Then t lines follow, each representing a test case. Each line contains one string s (1≤|s|≤100); each character of s is either 0 or 1.

Output
Print t integers, where the i-th integer is the answer to the i-th testcase (the minimum number of 0’s that you have to erase from s).

Example
input

3
010011
0
1111000

output

2
0
0

#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <algorithm>
using namespace std;


int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        int a = 0;
        int b = 0;
        for (int j = 0; j < s.size(); j++) {
            if (s[j] == '1') {
                a = j;                           //记录第一个1的位置
                break;
            }
        }
        for (int j = s.size() - 1; j > -1; j--) {
            if (s[j] == '1') {
                b = j;                           //记录最后一个1的位置
                break;
            }
        }
        int ans = 0;
        for (int j = a; j < b; j++) {
            if (s[j] == '0') {
                ans++;                           //计算从第一个1到最后一个1中0的个数
            }
        }
        cout << ans << endl;
    }
}

另一种思路，用数组记录下1的所有下标，再用数组最后一个元素减去第一个元素，即得到区间的长度，而数组长度就是区间中1的个数，相减即可得到答案。