245. Shortest Word Distance III 单词可以重复的最短单词距离

Posted immiao0319

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了245. Shortest Word Distance III 单词可以重复的最短单词距离相关的知识,希望对你有一定的参考价值。

[抄题]:

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

word1 and word2 may be the same and they represent two individual words in the list.

Example:
Assume that words = ["practice", "makes", "perfect", "coding", "makes"].

Input: word1 = “makes”, word2 = “coding”
Output: 1
Input: word1 = "makes", word2 = "makes"
Output: 3

 [暴力解法]:

把word1所有的index存一个数组,把word2所有的index存一个数组,再i*j全部扫一遍

时间分析:n^2

空间分析:

 [优化后]:

每次走一个index都随时更新一下i1 i2

时间分析:n

空间分析:

[奇葩输出条件]:

[奇葩corner case]:

虽然不麻烦,但是Integer.MAX_VALUE 必须要存成long型,然后转回来就行了。不然会报错。

[思维问题]:

[英文数据结构或算法,为什么不用别的数据结构或算法]:

[一句话思路]:

[输入量]:空: 正常情况:特大:特小:程序里处理到的特殊情况:异常情况(不合法不合理的输入):

[画图]:

技术分享图片

[一刷]:

[二刷]:

[三刷]:

[四刷]:

[五刷]:

  [五分钟肉眼debug的结果]:

[总结]:

p1 p2相等的时候,暂存一下之前的p2

if (word1.equals(word2)) 
                    //store in p1 temporarily
                    p1 = p2;
                 p2 = i; 

[复杂度]:Time complexity: O(n) Space complexity: O(1)

[算法思想:迭代/递归/分治/贪心]:

[关键模板化代码]:

[其他解法]:

[Follow Up]:

[LC给出的题目变变变]:

 [代码风格] :

 [是否头一次写此类driver funcion的代码] :

 [潜台词] :

技术分享图片
class Solution {
    public int shortestWordDistance(String[] words, String word1, String word2) {
        //ini: p1, p2 into the long type
        long result = Integer.MAX_VALUE;
        long p1 = Integer.MAX_VALUE;
        long p2 = -Integer.MAX_VALUE;
        
        
        //for loop: for each words[i], renew the answer
        for (int i = 0; i < words.length; i++) {
            if (words[i].equals(word1)) p1 = i;
            if (words[i].equals(word2)) 
                {
                if (word1.equals(word2)) 
                    //store in p1 temporarily
                    p1 = p2;
                 p2 = i; 
            }  
            //renew the answer
            result = Math.min(result, Math.abs(p2 - p1));
        }
        
        //return
        return (int)result;
    }
}
View Code

 


以上是关于245. Shortest Word Distance III 单词可以重复的最短单词距离的主要内容,如果未能解决你的问题,请参考以下文章

[LC] 243. Shortest Word Distance

Leetcode solution 243: Shortest Word Distance

[LeetCode] 243. Shortest Word Distance 最短单词距离

[LeetCode] 244. Shortest Word Distance II 鏈€鐭崟璇嶈窛绂?II

934. Shortest Bridge

Shortest Unsorted Continuous Subarray