据我所知,我编写了表示该问题解决方案的代码: https://www.hackerrank.com/challenges/make-it-anagram-mglines/problem
我的代码:
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int convert(char alphabet)
{
for (int i = 1; i<=26;i++)
{
if ("abcdefghijklmnopqrstuvwxyz"[i-1] == alphabet)
return i;
}
}
int main()
{
string a,b;
getline(cin, a);
getline(cin, b);
int l1 = a.length();
int l2 = b.length();
int l3 = max(l1,l2);
int i, ans;
ans = 0;
int count1[26],count2[26];
for (i=1;i<=l1;i++)
count1[convert(a[i-1])-1]++;
for (i=1;i<=l2;i++)
count2[convert(b[i-1])-1]++;
for (i=1;i<=26;i++)
ans+= count1[i-1]+count2[i-1]-2*(min(count1[i-1],count2[i-1]));
cout << ans << endl;
return 0;
}
我不知道为什么在尝试运行时收到此警告:
test.cpp:14:1: warning: control may reach end of non-void function [-Wreturn-type]
}
^
1 warning generated.
请帮助。