[Leetcode]Count Numbers with Unique Digits

最新推荐文章于 2022-07-08 08:19:09 发布

dyllanzhou

最新推荐文章于 2022-07-08 08:19:09 发布

阅读量410

点赞数

分类专栏： Math 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/dyllanzhou/article/details/52439618

版权

Math 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10ⁿ.

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

Credits:
Special thanks to @memoryless for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

class Solution {
public:
    /*algorithm
        sum = C(9,1)*C(8,1)*...*C(1,1)+... + C(9,1)
    */
    int countNumbersWithUniqueDigits(int n) {
        if(n == 0)return 1;
        int sum = 10;
        int val = 9;
        int count = 9;
        for(int i = 1;i < n;i++){
            val *= count;
            sum += val;
            count--;
        }
        return sum;
    }
};