LeetCode 题解(267) : Shortest Word Distance

题目：

Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.

For example,
Assume that words = ["practice", "makes", "perfect", "coding", "makes"].

Given word1 = “coding”, word2 = “practice”, return 3.
Given word1 = "makes", word2 = "coding", return 1.

题解：

HashMap。

C++版：

class Solution {
public:
    int shortestDistance(vector<string>& words, string word1, string word2) {
        unordered_map<string, vector<int>> d;
        for(int i = 0; i < words.size(); i++) {
            if(d.find(words[i]) == d.end()) {
                vector<int> t(1, i);