# leetcode\_245

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

word1 and word2 may be the same and they represent two individual words in the list.

```
Example:
Assume that words = ["practice", "makes", "perfect", "coding", "makes"].

Input: word1 = “makes”, word2 = “coding”
Output: 1

Input: word1 = "makes", word2 = "makes"
Output: 3
```

## Note:

You may assume word1 and word2 are both in the list.

## Solutions

1. **straight forward**
2. Copy codes in problem 243.

```cpp
class Solution {
public:
    int shortestWordDistance(vector<string>& words, string word1, string word2) {
        int mins = INT_MAX;
        int i1 = -1, i2 = -1;
        if (word1 != word2) {
            for (int i = 0; i < words.size(); i++) {
                if (words[i] == word1)
                    i1 = i;
                else if (words[i] == word2)
                    i2 = i;
                if (i1 != -1 && i2 != -1)
                    mins = min(mins, abs(i1 - i2));
            }
        }
        else {
            for (int i = 0; i < words.size(); i++) {
                if (words[i] == word1) {
                    i2 = i;
                    if (i1 != -1)
                        mins = min(mins, abs(i1 - i2));
                    i1 = i2;
                }
            }
            return mins;
        }
        return mins;
    }
};
```