查找兄弟單詞
輸入描述: 先輸入字典中單詞的個數，再輸入n個單詞作為字典單詞。 輸入一個單詞，查找其在字典中兄弟單詞的個數 再輸入數字n
輸出描述: 根據輸入，輸出查找到的兄弟單詞的個數
輸入例子: 3 abc bca cab abc 1
輸出例子: 2 bca
#include <cstdio>#include <string>#include <vector>#include <iostream>#include <algorithm>using namespace std;vector<string> dict;bool is_friend(string a, string b){ if (a == b) return false; sort(a.begin(), a.end()); sort(b.begin(), b.end()); return a == b;}int main(){ int n; while (scanf("%d", &n) == 1) { dict.clear(); for (int i = 0; i < n; i++) { string s; cin >> s; dict.push_back(s); } sort(dict.begin(), dict.end()); string ask; cin >> ask; int id; scanf("%d", &id); int cnt = 0; string res = ""; for (int i = 0; i < (int)dict.size(); i++) { if (is_friend(dict[i], ask)) { cnt++; if (cnt == id) { res = dict[i]; } } }新聞熱點
疑難解答
