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

	public static int countNumbersWithUniqueDigits2(int n) {
		int result = 1;
		int res = 9;
		for (int i = 1; i <= n; i++) {
			result += res;
			res *= 10 - i;
		}
		return result;
	}