318. 最大单词长度乘积

318. 最大单词长度乘积

• 难度: medium
• 原始链接: https://leetcode.cn/problems/maximum-product-of-word-lengths
• 标签: 位运算

解法一: 位运算

go

func maxProduct(words []string) int {
    length := len(words)
    arr := make([]int, length)
    for i := 0; i < length; i++ {
        num := 0
        for _, word := range words[i] {
            num |= 1 << int(word - 'a')
        }
        arr[i] = num
    }
    ans := 0
    for i := 0; i < length; i++ {
        for j := 0; j < length; j++ {
            if arr[i] & arr[j] == 0 {
                ans = max(ans, len(words[i]) * len(words[j]))
            }
        }
    }
    return ans
}

func max(num1, num2 int) int {
    if num1 >= num2 {
        return num1
    }
    return num2
}