package com.fishercoder.solutions;

/**
 * 243. 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.

 Note:
 You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.*/
public class _243 {
    public static class Solution1 {
        public int shortestDistance(String[] words, String word1, String word2) {
            int p = -1;
            int q = -1;
            int min = Integer.MAX_VALUE;
            for (int i = 0; i < words.length; i++) {
                if (words[i].equals(word1)) {
                    p = i;
                }
                if (words[i].equals(word2)) {
                    q = i;
                }
                if (p != -1 && q != -1) {
                    min = Math.min(min, Math.abs(p - q));
                }
            }
            return min;

        }
    }
}

@@ -33,469 +33,8 @@
 s;%0A%0A
-/**%0A * 243. Shortest Word Distance%0A *%0A * Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.%0A%0A For example,%0A Assume that words = %5B%22practice%22, %22makes%22, %22perfect%22, %22coding%22, %22makes%22%5D.%0A%0A Given word1 = %E2%80%9Ccoding%E2%80%9D, word2 = %E2%80%9Cpractice%E2%80%9D, return 3.%0A Given word1 = %22makes%22, word2 = %22coding%22, return 1.%0A%0A Note:%0A You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.*/%0A
 publ

refactor 243