java.lang.Object
g0301_0400.s0318_maximum_product_of_word_lengths.Solution

public class Solution extends Object
318 - Maximum Product of Word Lengths\. Medium Given a string array `words`, return _the maximum value of_ `length(word[i]) * length(word[j])` _where the two words do not share common letters_. If no such two words exist, return `0`. **Example 1:** **Input:** words = ["abcw","baz","foo","bar","xtfn","abcdef"] **Output:** 16 **Explanation:** The two words can be "abcw", "xtfn". **Example 2:** **Input:** words = ["a","ab","abc","d","cd","bcd","abcd"] **Output:** 4 **Explanation:** The two words can be "ab", "cd". **Example 3:** **Input:** words = ["a","aa","aaa","aaaa"] **Output:** 0 **Explanation:** No such pair of words. **Constraints:** * `2 <= words.length <= 1000` * `1 <= words[i].length <= 1000` * `words[i]` consists only of lowercase English letters.
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • maxProduct

      public int maxProduct(String[] words)