DNA匹配

做法一：

#include <iostream>
#include <map>
#include <string>
#include <list>
using namespace std;

bool isEqual(string a, string b)
{
    if (a.length() != b.length())
    {
        return false;
    }
    int i;
    for (i = 0; i < a.length(); )
    {
        if (a[i] == 'A' && b[i] == 'T')
            i++;
        else if (a[i] == 'T' && b[i] == 'A')
            i++;
        else if (a[i] == 'C' && b[i] == 'G')
            i++;
        else if (a[i] == 'G' && b[i] == 'C')
            i++;
        else
            break;
    }
    if (i == a.length())
    {
        return true;
    }
    else
    {
        return false;
    }
}

int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        list<string>