c++：如何判断两个单词是否为Anagram

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

string isAnagram(string word1, string word2)
{
    int len1 = word1.size();
    int len2 = word2.size();
    int flag = 1;
    if(len1 != len2)
        flag = 0;
    else
    {
        int a[26][2]={0};
        for(int i=0;i<len1;i++)
        {
            a[word1[i]-97][0]++;
            a[word2[i]-97][1]++;
        }
        for(int j=0;j<26;j++)
        {
            if(a[j][0]!=a[j][1])
                flag = 0;
        }

    }
    if(flag==0)
        return "is not";
    else
        return "yes";
}

int main()
{
    string word1,word2;

    cout<<"Please input word1:";
    cin>>word1;
    cout<<"Please input word2:";
    cin>>word2;

    cout<<isAnagram(word1, word2)<<endl;
    return 0;
}