Leetcode - Shortest Word Distance

https://leetcode.com/problems/shortest-word-distance/

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"].

Input: word1 = "coding", word2 = "practice"
Output: 3

Input: word1 = "makes", word2 = "coding"
Output: 1

func shortestDistance(words []string, word1 string, word2 string) int {
    if word1 == word2 {
        return -1
    }
    w1 := -1
    w2 := -1
    result := math.MaxInt32
    for i, w := range words {
        if w == word1 {
            w1 = i
        }
        if w == word2 {
            w2 = i
        }
        if w1 >= 0 && w2 >= 0 {
            tmp := abs(w1 - w2)
            result = min(tmp, result)
        }
    }
    return min(result, abs(w1-w2))
}

func abs(a int) int {
    if a < 0 {
        return 0 - a
    }
    return a
}

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

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