leetcode 243: Shortest Word Distance

最新推荐文章于 2024-08-08 14:17:25 发布

原创最新推荐文章于 2024-08-08 14:17:25 发布 · 5.3k 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

216 篇文章

订阅专栏

本文介绍了一个算法，用于在给定的单词列表中找到两个特定单词之间的最短距离。通过遍历列表并使用if条件判断，实现对目标单词的查找，计算它们之间的距离。

Shortest Word Distance

Total Accepted: 1754 Total Submissions: 4239 Difficulty: 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.

[CODE]

public class Solution {
    public int shortestDistance(String[] words, String word1, String word2) {
        int i=-1, j=-1;
        int min = Integer.MAX_VALUE;
        for(int k=0; k<words.length; k++) {
            if(words[k].equals(word1) ) {
                if(j!=-1 && i==-1) {
                    min = k - j;
                } else {
                    min = Math.min(min, k-j);
                }
                i = k;
            } else if(words[k].equals(word2)){
                if(i!=-1 && j==-1) {
                    min = k - i;
                } else {
                    min = Math.min(min, k-i);
                }
                j = k;
            }
        }        
        return min;
    }
}