#2376
Count Special Integers
master · 1655 · lc hard +32 · verified · 41.8% accepted · 628 likes · top 22%
Description
A positive integer is special if no two of its digits are the same.
Given a positive integer n, return how many special integers lie in the range [1, n].
Example 1:
Input: n = 20
Output: 19
Explanation: All the integers from 1 to 20, except 11, are special. Thus, there are 19 special integers.
Example 2:
Input: n = 5
Output: 5
Explanation: All the integers from 1 to 5 are special.
Example 3:
Input: n = 135
Output: 110
Explanation: There are 110 integers from 1 to 135 that are special.
Some of the integers that are not special are: 22, 114, and 131.
Code
1
2
3