LeetCode – Shortest Word Distance (Java)

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.

Java Solution

public int shortestDistance(String[] words, String word1, String word2) {
   int m=-1;
   int n=-1;
   int min = Integer.MAX_VALUE;
   for(int i=0; i<words.length; i++){
        String s = words[i];
            m = i;
                min = Math.min(min, m-n);
        }else if(word2.equals(s)){
            n = i;
                min = Math.min(min, n-m);
   return min;
Category >> Algorithms  
If you want someone to read your code, please put the code inside <pre><code> and </code></pre> tags. For example:
String foo = "bar";