naming-a-company

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 an array of strings <code>ideas</code> that represents a list of names to be used in the process of naming a company. The process of naming a company is as follows:

<ol>
	<li>Choose 2 distinct names from <code>ideas</code>, call them <code>ideaA</code> and <code>ideaB</code>.</li>
	<li>Swap the first letters of <code>ideaA</code> and <code>ideaB</code> with each other.</li>
	<li>If both of the new names are not found in the original <code>ideas</code>, then the name <code>ideaA ideaB</code> (the concatenation of <code>ideaA</code> and <code>ideaB</code>, separated by a space) is a valid company name.</li>
	<li>Otherwise, it is not a valid name.</li>
</ol>

Return the number of distinct valid names for the company.

&nbsp;
Example 1:

<pre>
Input: ideas = [&quot;coffee&quot;,&quot;donuts&quot;,&quot;time&quot;,&quot;toffee&quot;]
Output: 6
Explanation: The following selections are valid:
- (&quot;coffee&quot;, &quot;donuts&quot;): The company name created is &quot;doffee conuts&quot;.
- (&quot;donuts&quot;, &quot;coffee&quot;): The company name created is &quot;conuts doffee&quot;.
- (&quot;donuts&quot;, &quot;time&quot;): The company name created is &quot;tonuts dime&quot;.
- (&quot;donuts&quot;, &quot;toffee&quot;): The company name created is &quot;tonuts doffee&quot;.
- (&quot;time&quot;, &quot;donuts&quot;): The company name created is &quot;dime tonuts&quot;.
- (&quot;toffee&quot;, &quot;donuts&quot;): The company name created is &quot;doffee tonuts&quot;.
Therefore, there are a total of 6 distinct company names.

The following are some examples of invalid selections:
- (&quot;coffee&quot;, &quot;time&quot;): The name &quot;toffee&quot; formed after swapping already exists in the original array.
- (&quot;time&quot;, &quot;toffee&quot;): Both names are still the same after swapping and exist in the original array.
- (&quot;coffee&quot;, &quot;toffee&quot;): Both names formed after swapping already exist in the original array.
</pre>

Example 2:

<pre>
Input: ideas = [&quot;lack&quot;,&quot;back&quot;]
Output: 0
Explanation: There are no valid selections. Therefore, 0 is returned.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= ideas.length &lt;= 5 * 104</code></li>
	<li><code>1 &lt;= ideas[i].length &lt;= 10</code></li>
	<li><code>ideas[i]</code> consists of lowercase English letters.</li>
	<li>All the strings in <code>ideas</code> are unique.</li>
</ul>

distinctNames

Naming a Company

Bit Manipulation

Array

Hash Table

String

Enumeration

给你一个字符串数组 <code>ideas</code> 表示在公司命名过程中使用的名字列表。公司命名流程如下：

<ol>
	<li>从 <code>ideas</code> 中选择 2 个 不同 名字，称为 <code>ideaA</code> 和 <code>ideaB</code> 。</li>
	<li>交换 <code>ideaA</code> 和 <code>ideaB</code> 的首字母。</li>
	<li>如果得到的两个新名字 都 不在 <code>ideas</code> 中，那么 <code>ideaA ideaB</code>（串联 <code>ideaA</code> 和 <code>ideaB</code> ，中间用一个空格分隔）是一个有效的公司名字。</li>
	<li>否则，不是一个有效的名字。</li>
</ol>

返回 不同 且有效的公司名字的数目。

&nbsp;

示例 1：

<pre>输入：ideas = ["coffee","donuts","time","toffee"]
输出：6
解释：下面列出一些有效的选择方案：
- ("coffee", "donuts")：对应的公司名字是 "doffee conuts" 。
- ("donuts", "coffee")：对应的公司名字是 "conuts doffee" 。
- ("donuts", "time")：对应的公司名字是 "tonuts dime" 。
- ("donuts", "toffee")：对应的公司名字是 "tonuts doffee" 。
- ("time", "donuts")：对应的公司名字是 "dime tonuts" 。
- ("toffee", "donuts")：对应的公司名字是 "doffee tonuts" 。
因此，总共有 6 个不同的公司名字。

下面列出一些无效的选择方案：
- ("coffee", "time")：在原数组中存在交换后形成的名字 "toffee" 。
- ("time", "toffee")：在原数组中存在交换后形成的两个名字。
- ("coffee", "toffee")：在原数组中存在交换后形成的两个名字。
</pre>

示例 2：

<pre>输入：ideas = ["lack","back"]
输出：0
解释：不存在有效的选择方案。因此，返回 0 。
</pre>

&nbsp;

提示：

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