string-matching-in-an-array

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 an array of string <code>words</code>, return all strings in <code>words</code> that are a substring of another word. You can return the answer in any order.

&nbsp;
Example 1:

<pre>
Input: words = [&quot;mass&quot;,&quot;as&quot;,&quot;hero&quot;,&quot;superhero&quot;]
Output: [&quot;as&quot;,&quot;hero&quot;]
Explanation: &quot;as&quot; is substring of &quot;mass&quot; and &quot;hero&quot; is substring of &quot;superhero&quot;.
[&quot;hero&quot;,&quot;as&quot;] is also a valid answer.
</pre>

Example 2:

<pre>
Input: words = [&quot;leetcode&quot;,&quot;et&quot;,&quot;code&quot;]
Output: [&quot;et&quot;,&quot;code&quot;]
Explanation: &quot;et&quot;, &quot;code&quot; are substring of &quot;leetcode&quot;.
</pre>

Example 3:

<pre>
Input: words = [&quot;blue&quot;,&quot;green&quot;,&quot;bu&quot;]
Output: []
Explanation: No string of words is substring of another string.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= words.length &lt;= 100</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 30</code></li>
	<li><code>words[i]</code> contains only lowercase English letters.</li>
	<li>All the strings of <code>words</code> are unique.</li>
</ul>

stringMatching

String Matching in an Array

Substring XOR Queries

substring-xor-queries

子字符串异或查询

Array

String

String Matching

给你一个字符串数组 <code>words</code> ，数组中的每个字符串都可以看作是一个单词。请你按 任意 顺序返回 <code>words</code> 中是其他单词的 子字符串 的所有单词。

&nbsp;

示例 1：

<pre>
输入：words = ["mass","as","hero","superhero"]
输出：["as","hero"]
解释："as" 是 "mass" 的子字符串，"hero" 是 "superhero" 的子字符串。
["hero","as"] 也是有效的答案。
</pre>

示例 2：

<pre>
输入：words = ["leetcode","et","code"]
输出：["et","code"]
解释："et" 和 "code" 都是 "leetcode" 的子字符串。
</pre>

示例 3：

<pre>
输入：words = ["blue","green","bu"]
输出：[]
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= words.length &lt;= 100</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 30</code></li>
	<li><code>words[i]</code> 仅包含小写英文字母。</li>
	<li>题目数据 保证 <code>words</code>&nbsp;的每个字符串都是独一无二的。</li>
</ul>