10508 - Word Morphing

題目敘述：here

解題想法：

• 比較兩個字串有幾個字元不同，算出有幾個不同，輸出的順序是由小排到大。


• 假設現在輸入了6個字串，則第一個和第二個比較，第一個和第三個比較，以此類推。

程式碼：

          
//  鄒雨笙 UVa Online Judge 2023/11/3
//
//  Problem 10508 - Word Morphing


#include<iostream>
#include<vector>
#include<map>
#include<string>
using namespace std;


int compareWord(string originWord, string word, int numLetter) {
    int numDiff = 0;
    for (int i = 0; i < numLetter; i++) {
        if (originWord[i] != word[i]) {
            numDiff++;
        }
    }
    return numDiff;
}


void compareWordToCountDiff(vector<string> words, map<int, string> &resultUnsorted, int numLetter) {
    string originWord;
    int numDiff;
    originWord = words[0];
    
    for (int i = 1; i < words.size(); i++) {
        numDiff = compareWord(originWord, words[i], numLetter);
        // cout << numDiff << endl;
        resultUnsorted[numDiff] = words[i];
    }

}


int main() {

    int numWord, numLetter;
    string word;
    vector<string> words;
    map<int, string> resultUnsorted;

    while(cin >> numWord >> numLetter) {
        for (int i = 0; i < numWord; i++) {
            cin >> word;
            words.push_back(word);
        }

        compareWordToCountDiff(words, resultUnsorted, numLetter);

        // cout << endl;
        // for (auto word : words) {
        //     cout << word << endl;
        // }

        cout << words[0] << endl;
        for (auto word : resultUnsorted) {
            cout << word.second << endl;
        }
        words.clear();
        resultUnsorted.clear();

    
    }

    return 0;
}