Leetcode 243. Shortest Word Distance (Easy) (cpp)
Tag: Array
Difficulty: Easy
这是一道locked题目,给评论个“赞”呗?
/*
243. Shortest Word Distance (Easy)
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.
Note:
You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.
*/
class Solution {
public:
int shortestDistance(vector<string>& words, string word1, string word2) {
int p1 = -1, p2 = -1, mindis = INT_MAX;
for (int k = 0; k < words.size(); k++) {
if (isMatched(words[k], word1)) {
p1 = k;
} else if (isMatched(words[k], word2)) {
p2 = k;
}
if (p1 != -1 && p2 != -1) {
mindis = min(mindis, abs(p1 - p2));
}
}
return mindis;
}
private:
bool isMatched(string words, string word1) {
int len = words.length();
if (len == word1.length()) {
int i = 0;
for (; i < len; i++) {
if (words[i] != word1[i]) {
break;
}
}
if (i == len) {
return true;
}
}
return false;
}
};