确定两串乱序同构

<span style="font-family: Arial, Helvetica, sans-serif;">bool Replacement::checkSam(string stringA, string stringB)</span>

{
	int length1=stringA.length();
	int length2=stringB.length();
	if (length1!=length2)
	{
		return false;
	}
	int count1=0, count2=0;
	for (int i=0; i< length1; i++)
      { for( int j= 0 ; j< length2 ;j ++)
	    {
		   if (stringA[i]==stringA[j]) 
			     count1++;
		    if (stringA[i]== stringB[j])
			     count2++;
	    }
	  }
	    if (count1== count2)
	   {
		return true;
	    }
	    else{
		return false;
		}
}