LeetCode Q245: 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 diff(vector<string>& words, string word1, string word2) {
	int p1=-1*words.size(), p2=-1*words.size();
	int sdist=words.size()-1;
	for(int i=0; i<words.size(); i++){
	if(words[i]==word1){
	p1=i;
	sdist=min(sdist, abs(p2-p1));
	continue;
	}
	if(words[i]==word2){
	p2=i;
	sdist=min(sdist, abs(p2-p1));
	continue;
	}
	}
	return sdist;
	}
	int same(vector<string>&words, string word){
	int loc=-1*words.size();
	int dist=INT_MAX;
	for(int i=0; i<words.size(); i++){
	if(words[i]==word){
	dist=min(dist, i-loc);
	loc=i;
	}
	}
	return dist;
	}
	int shortestWordDistance(vector<string>& words, string word1, string word2) {
	if(word1!=word2)
	return diff(words, word1, word2);
	else
	return same(words, word1);
	}
	};

view raw Q245.cpp hosted with ❤ by GitHub

	class Solution {
	public:
	int shortestWordDistance(vector<string>& words, string word1, string word2) {
	int dist = INT_MAX;
	int pos1 = -words.size();
	int pos2 = words.size();
	for(int i=0; i<words.size(); i++){
	if(words[i]==word1){
	dist = word1==word2? min(dist, abs(i-pos1)):min(dist, abs(i-pos2));
	pos1 = i;
	}
	if(words[i]==word2){
	dist = word1==word2? min(dist, abs(i-pos2)):min(dist, abs(i-pos1));
	pos2 = i;
	}
	}
	return dist;
	}
	};

view raw Q245Rnd2.cpp hosted with ❤ by GitHub