maximum-product-of-word-lengths

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string array <code>words</code>, return the maximum value of <code>length(word[i]) * length(word[j])</code> where the two words do not share common letters. If no such two words exist, return <code>0</code>.

&nbsp;
Example 1:

<pre>
Input: words = [&quot;abcw&quot;,&quot;baz&quot;,&quot;foo&quot;,&quot;bar&quot;,&quot;xtfn&quot;,&quot;abcdef&quot;]
Output: 16
Explanation: The two words can be &quot;abcw&quot;, &quot;xtfn&quot;.
</pre>

Example 2:

<pre>
Input: words = [&quot;a&quot;,&quot;ab&quot;,&quot;abc&quot;,&quot;d&quot;,&quot;cd&quot;,&quot;bcd&quot;,&quot;abcd&quot;]
Output: 4
Explanation: The two words can be &quot;ab&quot;, &quot;cd&quot;.
</pre>

Example 3:

<pre>
Input: words = [&quot;a&quot;,&quot;aa&quot;,&quot;aaa&quot;,&quot;aaaa&quot;]
Output: 0
Explanation: No such pair of words.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= words.length &lt;= 1000</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 1000</code></li>
	<li><code>words[i]</code> consists only of lowercase English letters.</li>
</ul>

maxProduct

Maximum Product of Word Lengths

Bit Manipulation

Array

String

给你一个字符串数组&nbsp;<code>words</code> ，找出并返回 <code>length(words[i]) * length(words[j])</code>&nbsp;的最大值，并且这两个单词不含有公共字母。如果不存在这样的两个单词，返回 <code>0</code> 。

&nbsp;

示例&nbsp;1：

<pre>
输入：words = <code>["abcw","baz","foo","bar","xtfn","abcdef"]</code>
输出：<code>16 
解释</code>：<code>这两个单词为 "abcw", "xtfn"</code>。</pre>

示例 2：

<pre>
输入：words = <code>["a","ab","abc","d","cd","bcd","abcd"]</code>
输出：<code>4 
解释</code>：这两个单词为 <code>"ab", "cd"</code>。</pre>

示例 3：

<pre>
输入：words = <code>["a","aa","aaa","aaaa"]</code>
输出：<code>0 
解释</code>：<code>不存在这样的两个单词。</code>
</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= words.length &lt;= 1000</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 1000</code></li>
	<li><code>words[i]</code>&nbsp;仅包含小写字母</li>
</ul>