357. Count Numbers with Unique Digits

时间：2016-06-20 12:49:05 阅读：115 评论：0 收藏：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])

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 class Solution {
    public int countNumbersWithUniqueDigits(int n) {
        //f(1) = 10;
        //f(2) = f(1) + 9*9;
        //f(3) = f(2) + 9*9*8;
        //......
        if(n == 0)
            return 1;
        if(n == 1)
            return 10;
            
        int ret = 10;
        int current = 1;
        while(current<n && current<10)
        {
            int part2 = 9;
            for(int i=0;i<current;++i)
            {
                part2 *= 9-i;
            }
            ret += part2;
            ++current;
        }
        
        return ret;
    }
}

357. Count Numbers with Unique Digits

标签：

原文地址：http://www.cnblogs.com/neweracoding/p/5599977.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行

357. Count Numbers with Unique Digits

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

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