[LeetCode]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 class Solution {
	 public int countNumbersWithUniqueDigits(int n) {
		 if(n==0) return 1;
		 if(n==1) return 10;
		 int base=9;
		 int re=10;
		 for(int i=2;i<=n;i++){
			 base=base*(9-i+2);
			 re+=base;
		 }
		 return re;
	 }
}