Erasing Zeroes

题意翻译

给一个$01$字符串$s$，它只包含$0$或$1$。 你要一个连续$1$的字符串，如$0$，$1$，$00111$，$01111100$等，而$0101$，$100001$，$11111111111101$等字符串则不是。 现在你有一个$01$字符串，求最删掉用多少个$0$使它变为连续$1$的字符串。 #### 输入格式 一行：$t$，表示组数。 接着$t$行：你要操作的$01$字符串。 #### 输出格式 $t$行：表示第$t$组的字符串的最少删掉$0$的个数 #### 样例解释 对于第一个字符串，你可以删掉第$3$与第$4$个$0$ ### 温馨提示：用Kotlin编程

题目描述

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?

输入输出格式

输入格式

The first line contains one integer $ t $ ( $ 1 \le t \le 100 $ ) — the number of test cases. Then $ t $ lines follow, each representing a test case. Each line contains one string $ s $ ( $ 1 \le |s| \le 100 $ ); each character of $ s $ is either 0 or 1.

输出格式

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 $ ).

输入输出样例

输入样例 #1

3
010011
0
1111000

输出样例 #1

2
0
0

说明

In the first test case you have to delete the third and forth symbols from string 010011 (it turns into 0111).