Package g0301_0400.s0357_count_numbers_with_unique_digits

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    357 - Count Numbers with Unique Digits.

    Medium

    Given an integer n, return the count of all numbers with unique digits, x, where <code>0 <= x < 10<sup>n</sup></code>.

    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 &lt;= n &lt;= 8

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer countNumbersWithUniqueDigits(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait