Solution (leetcode-in-java 1.15 API)

java.lang.Object
- g0301_0400.s0357_count_numbers_with_unique_digits.Solution

```
public class Solution
extends Object
```
357 - Count Numbers with Unique Digits\. Medium Given an integer `n`, return the count of all numbers with unique digits, `x`, where 0 <= x < 10ⁿ. **Example 1:** **Input:** n = 2 **Output:** 91 **Explanation:** The answer should be the total numbers in the range of 0 ≤ x < 100, excluding 11,22,33,44,55,66,77,88,99 **Example 2:** **Input:** n = 0 **Output:** 1 **Constraints:** * `0 <= n <= 8`

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int countNumbersWithUniqueDigits(int n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

countNumbersWithUniqueDigits

public int countNumbersWithUniqueDigits(int n)