算法题

题目传送门

大致思路

可以看到所有氨基酸所占的列都是一样的,打表记录所有氨基酸,注意处理空行和头尾特殊氨基酸,具体细节在代码注释里

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
vector<vector<string>> bzd= {
        {
            " H H O  ",
            " | | || ",
            "-N-C-C--",
            "   |    ",
            " H-C-H  ",
            "   |    ",
            "   H    "
        },
        {
            " H H O  ",
            " | | || ",
            "-N-C-C--",
            "   |    ",
            " H-C-H  ",
            "   |    ",
            " O=C-O-H"
        },
        {
            " H H O  ",
            " | | || ",
            "-N-C-C--",
            "   |    ",
            " H-C-H  ",
            "   |    ",
            " O=C-N-H",
            "     |  ",
            "     H  "
        },
        {
            " H H O  ",
            " | | || ",
            "-N-C-C--",
            "   |    ",
            " H-C-S-H",
            "   |    ",
            "   H    "
        },
        {
            " H H O  ",
            " | | || ",
            "-N-C-C--",
            "   |    ",
            "   H    "
        },
        {
            " H H O  ",
            " | | || ",
            "-N-C-C--",
            "   |    ",
            " H-C-O-H",
            "   |    ",
            " H-C-H  "
        },
        {
            " H H O  ",
            " | | || ",
            "-N-C-C--",
            "   |    ",
            " H-C-H  ",
            "   |    ",
            " H-C-H  ",
            "   |    ",
            "   S    ",
            "   |    ",
            " H-C-H  ",
            "   |    ",
            "   H    "
        },
        {
            " H H O  ",
            " | | || ",
            "-N-C-C--",
            "   |    ",
            " H-C-O-H",
            "   |    ",
            " H-C-H  ",
            "   |    ",
            "   H    "
        },
        {
            " H H O  ",
            " | | || ",
            "-N-C-C--",
            "   |    ",
            " H-C-H  ",
            "   |    ",
            " H-C-H  ",
            "   |    ",
            " O=C-N-H",
            "     |  ",
            "     H  "
        },
        {
            " H H O  ",
            " | | || ",
            "-N-C-C--",
            "   |    ",
            " H-C-H  ",
            "   |    ",
            " H-C-H  ",
            "   |    ",
            " O=C-O-H"
        }
    }; //打表记录所有氨基酸,不要写头尾,后面统一处理

void solve() {
	map<string,int> mp; //映射表
	mp["Ala"]=0; mp["Asp"]=1; mp["Asn"]=2; mp["Cys"]=3; mp["Gly"]=4; mp["Ser"]=5; mp["Met"]=6; mp["Thr"]=7;mp["Gln"]=8; mp["Glu"]=9;
	int n;
	cin >> n;
	int mx=0;//记录所有氨基酸中,行数最大占多少,后面用于补充空格
	vector<string> a(n);
	for(int i=0;i<n;i++){
		cin >> a[i];
		int t=mp[a[i]];
		mx=max(mx,(int)bzd[t].size());
	}
	vector<string> ans(mx," "); //空出来一格专门给'H'
	ans[2]="H";
	for(int i=0;i<n;i++){ //注意输出不能一列一列输出,所以我们只能按行拼接,空格也要自己补
		auto t =bzd[mp[a[i]]];
		int row=t.size();
		for(int j=0;j<row;j++) ans[j]+=t[j];
		for(int j=row;j<mx;j++) ans[j]+=string(8,' ');
	}
	ans[2].pop_back();
	ans[2]+="O-H"; //尾氨基酸
	for(int i=0;i<mx;i++) cout << ans[i] <<el;
}

说些什么吧！

waline