题解 | #查找兄弟单词#
查找兄弟单词
https://www.nowcoder.com/practice/03ba8aeeef73400ca7a37a5f3370fe68
#include <bits/stdc++.h> using namespace std; bool isbro(string s1, string s2) { if (s1.size() == s2.size()) { if (s1 == s2) { return false; } sort(s1.begin(), s1.end()); sort(s2.begin(), s2.end()); if (s1 == s2) { return true; } } return false; } int main() { int n; while (cin >> n) { vector<string> strs(n); for (int i = 0; i < n; i++) { cin >> strs[i]; } string str; cin >> str; int k; cin >> k; vector<string> bros; for (int i = 0; i < n; i++) { if (isbro(str, strs[i])) { bros.push_back(strs[i]); } } sort(bros.begin(), bros.end()); cout << bros.size() << endl; if(k < bros.size()) cout << bros[k - 1] << endl; } }