Leetcode Everyday: 243. Shortest Word Distance

原创于 2016-05-11 23:36:29 发布 · 288 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

69 篇文章

订阅专栏

本文提供了一种解决LeetCode上单词距离问题的有效方法。该问题要求从给定的字符串数组中找出两个指定单词之间的最短距离。文章通过示例说明了如何遍历数组并跟踪两个目标单词的最新位置来实现这一目标。

https://leetcode.com/problems/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 Solution {
    public int shortestDistance(String[] words, String word1, String word2) {
        int i1 = -1;
        int i2 = -1;
        int dis = Integer.MAX_VALUE;
        for(int i = 0; i<words.length;i++){
            String s = words[i];
            if(s.equals(word1)){
                i1 = i;
                if(i2!=-1 && i1-i2<dis) dis = i1-i2;
            }
            if(s.equals(word2)){
                i2 = i;
                if(i1!=-1 && i2-i1<dis) dis = i2-i1;
            }
        }
        return dis;
    }
}