zoukankan      html  css  js  c++  java
  • Leetcode 357. Count Numbers with Unique Digits

    357. Count Numbers with Unique Digits

    • Total Accepted: 10844
    • Total Submissions: 25103
    • Difficulty: Medium

    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].

    思路:Hint中提示的一样,既可以用回溯,也可以用DP的递推。

    代码:

    方法一:

    n=0:  f(0)=1

    n=1:  f(1)=10

    2<=n<=10:  f(n)=9*9*8*...*(9-k+2)+f(k-1)

    n>10:  f(n)=f(10)

     1 class Solution {
     2 public:
     3     int countNumbersWithUniqueDigits(int n) {
     4         if(!n) return 1;
     5         int res=10,mutil=9;
     6         n=n>10?10:n;
     7         for(int i=1;i<n;i++){
     8             mutil*=10-i;
     9             res+=mutil;
    10         }
    11         return res;
    12     }
    13 };

    方法二:回溯法。

    java版的:

     1 public class Solution {
     2     public static int countNumbersWithUniqueDigits(int n) {
     3         if (n > 10) {
     4             return countNumbersWithUniqueDigits(10);
     5         }
     6         int count = 1; // x == 0
     7         long max = (long) Math.pow(10, n);
     8 
     9         boolean[] used = new boolean[10];
    10 
    11         for (int i = 1; i < 10; i++) {
    12             used[i] = true;
    13             count += search(i, max, used);
    14             used[i] = false;
    15         }
    16 
    17         return count;
    18     }
    19 
    20     private static int search(long prev, long max, boolean[] used) {
    21         int count = 0;
    22         if (prev < max) {
    23             count += 1;
    24         } else {
    25             return count;
    26         }
    27 
    28         for (int i = 0; i < 10; i++) {
    29             if (!used[i]) {
    30                 used[i] = true;
    31                 long cur = 10 * prev + i;
    32                 count += search(cur, max, used);
    33                 used[i] = false;
    34             }
    35         }
    36 
    37         return count;
    38     }
    39 }


    不过下面的c++版,运行超时。

     1 class Solution {
     2 public:
     3     int countNumbersWithUniqueDigits(long long cur,long long maxval,vector<bool> exist){
     4         if(cur>=maxval) return 0;
     5         int count=1;
     6         for(int i=0;i<10;i++){
     7             if(!exist[i]){
     8                 exist[i]=true;
     9                 count+=countNumbersWithUniqueDigits(cur*10+i,maxval,exist);
    10                 exist[i]=false;
    11             }
    12         }
    13         return count;
    14     }
    15     int countNumbersWithUniqueDigits(int n){
    16         int count=1;
    17         long long maxval=pow(10,n);
    18         n=n>10?10:n;
    19         vector<bool> exist(10,false);
    20         for(int i=1;i<10;i++){
    21             exist[i]=true;
    22             count+=countNumbersWithUniqueDigits(i,maxval,exist);           
    23             exist[i]=false;
    24         }
    25         return count;
    26     }
    27 };
  • 相关阅读:
    高斯函数 and 对数高斯函数 拟合曲线
    Python3.6、3.7、3.8新特性
    常用限流策略——漏桶与令牌桶介绍
    常用的HTTP服务压测工具介绍
    使用swagger生成接口文档
    validator库参数校验若干实用技巧
    树形结构数据处理
    element-ui 抽屉组件(el-drawer ) 二次封装 增加resize拖曳改变宽度大小
    pm2常用命令
    vue3-- setup中获取数组dom
  • 原文地址:https://www.cnblogs.com/Deribs4/p/5746487.html
Copyright © 2011-2022 走看看