ACM学习历程—广东工业大学2016校赛决赛－网络赛D 二叉树的中序遍历(数据结构)

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <string>
#define LL long long

using namespace std;

const int maxN = 100005;
char str[maxN];

void work()
{
    int len = strlen(str), cnt = 0;
    for (int i = 0; i < len; ++i)
    {
        if (str[i] == ‘#‘) cnt++;
        if (cnt == 2)
        {
            printf("no\n");
            return;
        }
        if (str[i] != ‘#‘) cnt = 0;
    }
    printf("yes\n");
}

int main()
{
    //freopen("test.in", "r", stdin);
    int T;
    scanf("%d", &T);
    for (int times = 1; times <= T; ++times)
    {
        scanf("%s", str);
        work();
    }
    return 0;
}