Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.
Example:
Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x < 100, excluding [11,22,33,44,55,66,77,88,99]
)
#include <iostream>
using namespace std;
class Solution {
public:
int countNumbersWithUniqueDigits(int n) {
int result = 10;
int dig = 9;
if(n == 0)
return 1;
else if(n == 1)
return 10;
else
{
for(int i=2;i<=n;i++)
{
dig = dig*(9-i+2);
result = result + dig;
}
return result;
}
}
};