算法竞赛入门经典第二版课后习题 3-7 DNA序列

算法竞赛入门经典第二版课后习题 3-7 DNA序列

# include <iostream>
# include <cstring>
using namespace std;

const char EN[] = "ACGT";

int main()
{
    int m,n;
    cin>>m>>n;
    char Map[m][n];
    char Min[n];//最小的DNA序列
    memset(Min,'\0',sizeof(Min));
    int r[4] = {0};
    int hamming[m] = {0};

    //输入DNA序列
    for(int i = 0; i < m; i++)
    {
        for(int j = 0; j < n; j++)
        {
            cin>>Map[i][j];
        }
    }
    //找最小序列
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < m; j++)
        {
            for(int x = 0; x < 4; x++)
            {
                if(Map[j][i] == EN[x])
                {
                    r[x]++;
                    break;
                }
            }
        }

        //找出出现次数最多（如果相等字典序最小）的字母
        int maxr = r[0];
        int index = 0;
        for(int y =  1; y < 4; y++)
        {
            if(r[y] > maxr)
            {
                maxr = r[y];
                index = y;
            }
        }
        Min[i] = EN[index];
        memset(r,0,sizeof(r));
    }

    //求hamming
    for(int i = 0; i < m; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(Map[i][j] != Min[j])
                hamming[i]++;
        }
    }

    cout<<"最小的DNA序列:\n";
    for(int i = 0; i < n; i++)
    {
        cout<<Min[i];
    }
    cout<<"\nhamming 距离：\n";
    for(int i = 0; i < m; i++)
        cout<<hamming[i]<<"  ";
    return 0;
}