word-subsets

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given two string arrays <code>words1</code> and <code>words2</code>.

A string <code>b</code> is a subset of string <code>a</code> if every letter in <code>b</code> occurs in <code>a</code> including multiplicity.

<ul>
	<li>For example, <code>&quot;wrr&quot;</code> is a subset of <code>&quot;warrior&quot;</code> but is not a subset of <code>&quot;world&quot;</code>.</li>
</ul>

A string <code>a</code> from <code>words1</code> is universal if for every string <code>b</code> in <code>words2</code>, <code>b</code> is a subset of <code>a</code>.

Return an array of all the universal strings in <code>words1</code>. You may return the answer in any order.

&nbsp;
Example 1:

<div class="example-block">
Input: words1 = [&quot;amazon&quot;,&quot;apple&quot;,&quot;facebook&quot;,&quot;google&quot;,&quot;leetcode&quot;], words2 = [&quot;e&quot;,&quot;o&quot;]

Output: [&quot;facebook&quot;,&quot;google&quot;,&quot;leetcode&quot;]
</div>

Example 2:

<div class="example-block">
Input: words1 = [&quot;amazon&quot;,&quot;apple&quot;,&quot;facebook&quot;,&quot;google&quot;,&quot;leetcode&quot;], words2 = [&quot;lc&quot;,&quot;eo&quot;]

Output: [&quot;leetcode&quot;]
</div>

Example 3:

<div class="example-block">
Input: words1 = [&quot;acaac&quot;,&quot;cccbb&quot;,&quot;aacbb&quot;,&quot;caacc&quot;,&quot;bcbbb&quot;], words2 = [&quot;c&quot;,&quot;cc&quot;,&quot;b&quot;]

Output: [&quot;cccbb&quot;]
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= words1.length, words2.length &lt;= 104</code></li>
	<li><code>1 &lt;= words1[i].length, words2[i].length &lt;= 10</code></li>
	<li><code>words1[i]</code> and <code>words2[i]</code> consist only of lowercase English letters.</li>
	<li>All the strings of <code>words1</code> are unique.</li>
</ul>

wordSubsets

Word Subsets

Array

Hash Table

String

给你两个字符串数组 <code>words1</code>&nbsp;和&nbsp;<code>words2</code>。

现在，如果&nbsp;<code>b</code> 中的每个字母都出现在 <code>a</code> 中，包括重复出现的字母，那么称字符串 <code>b</code> 是字符串 <code>a</code> 的 子集 。

<ul>
	<li>例如，<code>"wrr"</code> 是 <code>"warrior"</code> 的子集，但不是 <code>"world"</code> 的子集。</li>
</ul>

如果对 <code>words2</code> 中的每一个单词&nbsp;<code>b</code>，<code>b</code> 都是 <code>a</code> 的子集，那么我们称&nbsp;<code>words1</code> 中的单词 <code>a</code> 是 通用单词 。

以数组形式返回&nbsp;<code>words1</code> 中所有的 通用 单词。你可以按 任意顺序 返回答案。

&nbsp;

<ol>
</ol>

示例 1：

<div class="example-block">
输入：words1 = ["amazon","apple","facebook","google","leetcode"], words2 = ["e","o"]

输出：["facebook","google","leetcode"]
</div>

示例 2：

<div class="example-block">
输入：words1 = ["amazon","apple","facebook","google","leetcode"], words2 = ["lc","eo"]

输出：["leetcode"]
</div>

示例 3：

<div class="example-block">
输入：words1 = ["acaac","cccbb","aacbb","caacc","bcbbb"], words2 = ["c","cc","b"]

输出：["cccbb"]
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= words1.length, words2.length &lt;= 104</code></li>
	<li><code>1 &lt;= words1[i].length, words2[i].length &lt;= 10</code></li>
	<li><code>words1[i]</code> 和 <code>words2[i]</code> 仅由小写英文字母组成</li>
	<li><code>words1</code> 中的所有字符串 互不相同</li>
</ul>