zoukankan      html  css  js  c++  java
  • 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:

    1. A direct way is to use the backtracking approach.
    2. 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.
    3. This problem can also be solved using a dynamic programming approach and some knowledge of combinatorics.
    4. Let f(k) = count of numbers with unique digits with length equals k.
    5. f(1) = 10, ..., f(k) = 9 * 9 * 8 * ... (9 - k + 2) [The first factor is 9 because a number cannot start with 0].

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

      

     1 public class Solution {
     2     public int countNumbersWithUniqueDigits(int n) {
     3         if (n > 10) return 0;
     4         if (n == 0) return 1;
     5         
     6         int result = 10; // [0, 10) has 10 digits satisfying the condition
     7         int x = 9, y = 9;
     8         while (n > 1) {
     9             result += x * y;
    10             x *= y;
    11             y--;
    12             n--;
    13         }
    14         return result;
    15     }
    16 }
  • 相关阅读:
    简记配置tesorflow-gpu环境(吐血了)
    个人总结
    浪潮之巅阅读笔记03
    第十六周的学习进度条
    第十五周的学习进度条
    第十四的周学习进度条
    课堂练习-购书问题
    第二阶段—个人工作总结10
    第二阶段—个人工作总结09
    第二阶段—个人工作总结08
  • 原文地址:https://www.cnblogs.com/amazingzoe/p/6440354.html
Copyright © 2011-2022 走看看