LeetCode-243：Shortest Word Distance （单词最短距离）

最新推荐文章于 2020-10-27 10:08:49 发布

大树先生的博客

最新推荐文章于 2020-10-27 10:08:49 发布

阅读量1.4k

点赞数

分类专栏： LeetCode刷题 LeetCode 刷题文章标签： LeetCode 算法单词最短距离

本文链接：https://blog.csdn.net/Koala_Tree/article/details/78338549

版权

LeetCode刷题同时被 2 个专栏收录

71 篇文章 0 订阅

订阅专栏

LeetCode 刷题

71 篇文章 57 订阅

订阅专栏

Question

Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.

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.

问题解析：

给定单词list，返回其中任意两单词的最短位置距离。

Answer

Solution 1：

记录二者最新位置和最小距离，遍历实现。

因为list中可能存在相同的单词，所以不能使用Hash来实现；
通过两个指针指示两个单词的最新位置，遍历实现即可。

class Solution {  
    public int shortestDistance(String[] words, String word1, String word2) {  
        int pos1 = -1;  
        int pos2 = -1;  
        int distance = words.length-1;  
        for(int i=0; i<words.length; i++) {  
            if (word1.equals(words[i])) {  
                pos1 = i;  
                if (pos2 != -1 && pos1-pos2<distance) distance = pos1-pos2;  
            } else if (word2.equals(words[i])) {  
                pos2 = i;  
                if (pos1 != -1 && pos2-pos1<distance) distance = pos2-pos1;  
            }  
        }  
        return distance;  
    }  
}