通过交换操作检查两个字符串数组是否相等

#include <bits/stdc++.h>
using namespace std;
// Helper function to check if we can make the two arrays equal by performing swap operations on any of the two arrays
bool Helper(vector<string> s1, vector<string> s2){
   // If the size of both array sets is not the same we would return false right away as there is no way that we can make all the strings equal
	if(s1.size() != s2.size()){
      return false;
	}
	// Store the length of the string
	int n = s1.size();
	// start a loop to sort each string of both arrays
	for(int i=0; i < n; i++){
	   // sort string present at index i of the array of set 1
	   sort(s1[i].begin(),s1[i].end());
	   // sort string present at index i of the array of set 2
	   sort(s2[i].begin(), s2[i].end());
	}
	// Sort both arrays now so that we can compare the strings directly to ease our process
	sort(s1.begin(), s1.end());
	sort(s2.begin(), s2.end());
   // Start a loop to compare each string present in the two arrays
	for (int i = 0; i < n; i++){
	   // check if any string in set 1 is not equal to the corresponding string of set 2 after sorting, then there is no possible way to make both arrays equal
		if (s1[i] != s2[i]){
		   return false;
		}
	}
	// Return true if every single string of set 1 is equal to every corresponding string of set 2
	return true;
}
// Main function
int main(){
	vector<string> s1 = {"aachg", "klsm", "abcd"};
	vector<string> s2 = { "aghca", "dbca", "mlks"};
   // Call the Helper function to get a binary answer true (1) or false (0) based on which we would deliver our final output
	bool output = Helper(s1, s2);
	if(output==0){
	   cout<< "False: Not every single string of set 1 is equal to every other string of set 2" << endl;
	} else {
	   cout<< "True: Every single string of set 1 is equal to every other string of set 2" << endl;
	}
	return 0;
}	  

输出

True: Every single string of set 1 is equal to every other string of set 2