"Leetcode" Count Numbers with Unique Digits

Source: Internet
Author: User

Title Link: 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.

Given n = 2, return 91. (The answer should is the total numbers in the range of 0≤x <, excluding [11,22,33,44,55,66,77,88,99])


A Direct backtracking approach.
Backtracking should contains three states which is (the current number, number of steps to get, 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 is solved using a dynamic programming approach and some knowledge of combinatorics.
Let f (k) = Count of numbers with the unique digits with length equals K.
F (1) = ten, ..., f (k) = 9 * 9 * 8 * ... (9-k + 2) [The first factor is 9 because a number cannot start with 0].

Recursive equations are given, fools use backtracking. = =: And the backtracking looks so hard.


     Public intCountnumberswithuniquedigits (intN) {if(n = =0)return 1;int Count=0; for(inti =1; I <= N; i++) {//How many unique digits each person has            Count+ = cal (i); }return Count; } Public intCalintK) {int sum=9;if(k = =0)return 0;if(k = =1)return Ten; for(inti = OneK I <=9; i++) {sum*= i; }return sum; }

"Leetcode" Count Numbers with Unique Digits

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.