您当前位置：首页 > php开源 > php教程 > 【Leetcode】Count Numbers with Unique Digits

【Leetcode】Count Numbers with Unique Digits

来源：程序员人生发布时间：2016-07-14 08:42:28 阅读次数：2209次

题目链接：https://leetcode.com/problems/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])

Hint:

A direct way is to use the backtracking approach.
Backtracking should contains three states which are (the current number, number of steps to get that number and a bitmask which represent which number is marked as visited so far in the current number). Start with state (0,0,0) and count all valid number till we reach number of steps equals to 10n.
This problem can also be solved using a dynamic programming approach and some knowledge of combinatorics.
Let f(k) = count of numbers with unique digits with length equals k.
f(1) = 10, …, f(k) = 9 * 9 * 8 * … (9 - k + 2) [The first factor is 9 because a number cannot start with 0].

思路：
递推方程都给了，傻子采取回溯。。= =。。而且回溯看起来好难的模样。。

算法：

    public int countNumbersWithUniqueDigits(int n) {
        if (n == 0)
            return 1;
        int count = 0;
        for (int i = 1; i <= n; i++) {// 求每位有多少unique digits
            count += cal(i);
        }
        return count;
    }

    public int cal(int k) {
        int sum = 9;
        if (k == 0)
            return 0;
        if (k == 1)
            return 10;
        for (int i = 11 - k; i <= 9; i++) {
            sum *= i;
        }
        return sum;
    }

生活不易，码农辛苦
如果您觉得本网站对您的学习有所帮助,可以手机扫描二维码进行捐赠
程序员人生

------分隔线----------------------------

上一篇 Google深度学习笔记文本与序列的深度模型

下一篇 51 NOD 1024 矩阵中不重复的元素(技巧)

分享到:

------分隔线----------------------------

为码而活

积分：4237

15粉丝

7关注

栏目热点