check-if-the-number-is-fascinating

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 integer <code>n</code> that consists of exactly <code>3</code> digits.

We call the number <code>n</code> fascinating if, after the following modification, the resulting number contains all the digits from <code>1</code> to <code>9</code> exactly once and does not contain any <code>0</code>&#39;s:

<ul>
	<li>Concatenate <code>n</code> with the numbers <code>2 * n</code> and <code>3 * n</code>.</li>
</ul>

Return <code>true</code> if <code>n</code> is fascinating, or <code>false</code> otherwise.

Concatenating two numbers means joining them together. For example, the concatenation of <code>121</code> and <code>371</code> is <code>121371</code>.

&nbsp;
Example 1:

<pre>
Input: n = 192
Output: true
Explanation: We concatenate the numbers n = 192 and 2 * n = 384 and 3 * n = 576. The resulting number is 192384576. This number contains all the digits from 1 to 9 exactly once.
</pre>

Example 2:

<pre>
Input: n = 100
Output: false
Explanation: We concatenate the numbers n = 100 and 2 * n = 200 and 3 * n = 300. The resulting number is 100200300. This number does not satisfy any of the conditions.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>100 &lt;= n &lt;= 999</code></li>
</ul>

isFascinating

Check if The Number is Fascinating

Hash Table

Math

给你一个三位数整数 <code>n</code>&nbsp;。

如果经过以下修改得到的数字 恰好&nbsp;包含数字 <code>1</code>&nbsp;到 <code>9</code>&nbsp;各一次且不包含任何 <code>0</code>&nbsp;，那么我们称数字 <code>n</code>&nbsp;是 迷人的&nbsp;：

<ul>
	<li>将&nbsp;<code>n</code>&nbsp;与数字&nbsp;<code>2 * n</code> 和&nbsp;<code>3 * n</code>&nbsp;连接&nbsp;。</li>
</ul>

如果 <code>n</code>&nbsp;是迷人的，返回&nbsp;<code>true</code>，否则返回&nbsp;<code>false</code>&nbsp;。

连接&nbsp;两个数字表示把它们首尾相接连在一起。比方说&nbsp;<code>121</code> 和&nbsp;<code>371</code>&nbsp;连接得到&nbsp;<code>121371</code>&nbsp;。

&nbsp;

示例 1：

<pre>输入：n = 192
输出：true
解释：我们将数字 n = 192 ，2 * n = 384 和 3 * n = 576 连接，得到 192384576 。这个数字包含 1 到 9 恰好各一次。
</pre>

示例 2：

<pre>输入：n = 100
输出：false
解释：我们将数字 n = 100 ，2 * n = 200 和 3 * n = 300 连接，得到 100200300 。这个数字不符合上述条件。
</pre>

&nbsp;

提示：

<ul>
	<li><code>100 &lt;= n &lt;= 999</code></li>
</ul>