LeetCode Shortest Word Distance III

LeetCode Shortest Word Distance III

题目

服务器抽风无法上传图片。

This is a follow up of Shortest Word Distance. The only difference is now word1 could be the same as word2.

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.

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

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

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

思路

感觉比第二题简单。与第一题唯一的不同是两个字符串有可能相同，在这种情况下，我们只需要保证不会对两个在同一个位置的相同字符串计算最小距离即可。但是如果加上各种判断是很麻烦的，所以我们可以直接在对第一个字符串定位之后直接计算最小距离，同时保证两个字符串在字符串数组中的下标必定不同即可。

代码

class Solution {
public:
    int shortestWordDistance(vector<string>& words,
        string word1, string word2) {

        int ans = words.size(), p = -1, q = -1;

        for (int i = words.size() - 1; i >= 0; i--) {
            if (word1 == words[i]) p = i;
            if (p != -1 && q != -1 && p != q) ans = min(abs(p - q), ans);
            if (word2 == words[i]) q = i;
            if (p != -1 && q != -1 && p != q) ans = min(abs(p - q), ans);
        }

        return ans;
    }
};

更多

更多LeetCode题目（包括付费题）和题解。