DNA序列修正(蓝桥oj3904)

问题（附链接）：DNA序列修正

题解如下：

#include <bits/stdc++.h>
using namespace std;
int main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int n;
	cin >> n;
	string s1, s2;
	cin >> s1 >> s2;
	for (int i = 0; i < n; i++)
	{
		if (s1[i] == 'A')
			s1[i] = 'T';
		else if (s1[i] == 'T')
			s1[i] = 'A';
		else if (s1[i] == 'C')
			s1[i] = 'G';
		else if (s1[i] == 'G')
			s1[i] = 'C';
	}
	int count = 0;
	for (int i = 0; i < n; i++)
	{
		if (s1[i] == s2[i])
			continue;
		for (int j = i + 1 ; j < n; j++)
		{
			if (s1[i] == s2[j] && s1[j] == s2[i])
			{
				swap(s1[i], s1[j]);
				break;
			}
		}
		count++;
	}
	cout << count << '\n';
	return 0;
}