LeetCode 0357 - Count Numbers with Unique Digits

Reck Zhang

发布于 2021-08-11 11:31:52

2010

发布于 2021-08-11 11:31:52

文章被收录于专栏：Reck Zhang

Count Numbers with Unique Digits

Desicription

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

Example:

Input: 2
Output: 91 
Explanation: The answer should be the total numbers in the range of 0 ≤ x < 100, 
             excluding 11,22,33,44,55,66,77,88,99

Solution

class Solution {
public:
    int countNumbersWithUniqueDigits(int n) {
        if(n == 0) {
            return 1;
        }

        int res = 10;
        int count = 9;
        for(int i = 2; i <= n; i++) {
            count *= (11 - i);
            res += count;
        }

        return res;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2019-06-12，如有侵权请联系 cloudcommunity@tencent.com 删除

count