查找兄弟单词代码

#include<iostream>
#include<string>
#include<vector>
#include<sstream>
#include<algorithm>
using namespace std;

vector<string> judge_bro(vector<string> dic, string find_b)
{
//for (int i = 0; i < dic.size(); ++i)
// cout << dic[i] << " ";
//cout << find << "--";


vector<string> dic_bro;
auto length = find_b.length();

for (int i = 0; i < dic.size(); ++i)
{
if (dic[i].length() == length)
{
string tmp = dic[i];
string tmp_find = find_b;
sort(tmp.begin(), tmp.end());
sort(tmp_find.begin(), tmp_find.end());

if (tmp == tmp_find) //结果比较
{
if (dic[i] != find_b) //不相等的情况下
dic_bro.push_back(dic[i]);