Leetcode - Shortest Word Distance III

https://leetcode.com/problems/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

Somehow this is a series of problems. The pattern is

p1 = 0
p2 = p1 + 1
for p2 < len(arr) {
    for p1 < len(arr) && p1condition {
        p1++
    }
    p2 = p1+1
    for p2 < len(arr) && p2condition {
        p2++
    }
    if p2 >= len(arr) {
        break  
    }
    do something

    update p1
}

func shortestWordDistance(words []string, word1 string, word2 string) int {
    left := 0
    right := left + 1
    result := math.MaxInt32
    for right < len(words) {
        for left < len(words) && words[left] != word1 && words[left] != word2 {
            left++
        }
        first := words[left]
        var second string
        if first == word1 {
            second = word2
        } else {
            second = word1
        }
        right = left+1
        for right < len(words) && words[right] != second {
            right++
        }
        if right >= len(words) {
            break
        }
        result = min(result, right - left)
        left++
    }
    return result
}

func min(a, b int) int {
    if a < b {
        return a
    }
    return b
}

• 相关文章
• 全局相关文章