NJUST 1920 偷吃糖果

原题

Description

简单的说
两个字符串,重复字符变成一个,看是否相同

Code

#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
void solve()
{
  string s;
  cin >> s;
  string s1;
  for (int i = 0; i < s.size(); i++)
  {
    char c = s[i];
    while (i < s.size() - 1 && s[i] == s[i + 1]) i++;
    s1 += c;
  }
  string s2;
  cin >> s;
  for (int i = 0; i < s.size(); i++)
  {
    char c = s[i];
    while (i < s.size() - 1 && s[i] == s[i + 1]) i++;
    s2 += c;
  }
  if (s1 == s2) puts("Yes"); else puts("No");
}
int main()
{
  int t;
  cin >> t;
  for (int i = 0; i < t; i++)
    solve();
}

你可能感兴趣的:(NJUST 1920 偷吃糖果)