Leetcode - Shortest Word Distance

原创于 2015-08-17 22:01:02 发布 · 104 阅读

0 ·

CC 4.0 BY-SA版权

Array 专栏收录该内容

19 篇文章

订阅专栏

本文提供了一个算法解决方案，用于在一个单词列表中找到两个指定单词之间的最短距离。通过遍历列表并使用指针跟踪每个单词的位置，算法能够高效地计算并返回这两个单词之间的最小距离。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.


public class Solution {
    public int shortestDistance(String[] words, String word1, String word2) {
        if (words == null) return -1;
        int idx1 = -1, idx2 = -1;
        int diff = words.length;
        for (int i = 0; i < words.length; i++) {
            if (words[i].equals(word1)) {
                idx1 = i;
                if (idx2 != -1) 
                    diff = Math.min(diff, idx1 - idx2);
            } else if (words[i].equals(word2)) {
                idx2 = i;
                if (idx1 != -1) 
                    diff = Math.min(diff, idx2 - idx1);
            }
        }
        return diff;
    }
}