leetcode 357. Count Numbers with Unique Digits

找出所有不同的数字

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])

找出规律即可

0:1

1:10

2: 9*9

3:9*9*8

`````

class Solution {
    public int countNumbersWithUniqueDigits(int n) {
        if(n==0) return 1;
	int ans =10 ;
	int tag = 9;
	for (int i = 1; i<n; i++) {
		tag = tag*(10-i);
		ans+=tag;
		
	}
	return ans;
    }
}