Leetcode 318.最大单词长度乘积(Maximum Product of Word Lengths)
Leetcode318.最大单词长度乘积1题目描述(Leetcode题目链接) 给定一个字符串数组words,找到length(word[i])*length(word[j])的最大值,并且这两个单词不含有公共字母。你可以认为每个单词只包含小写字母。如果不存在这样的两个单词,返回0。输入:["abcw","baz","foo","bar","xtfn","abcdef"]输出:16解释:这两个单