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

    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.

    Subscribe to see which companies asked this question

     
     1 public class Solution {
     2     public int countNumbersWithUniqueDigits(int n) {
     3         if(n == 0) return 1;
     4         if(n == 1) return 10;
     5         int ans = 9;
     6         for(int i = 0; i < n-1; i++){
     7             ans *= (9 - i);
     8         }
     9         return ans += countNumbersWithUniqueDigits(n-1);
    10     }
    11 }

    按照提示很容易做出来,但是貌似n 只能小于等于10  ?

  • 相关阅读:
    验证控件没有向服务器发回数据
    立即窗口中体现回车换行
    初试发布功能
    文件内码不同造成的错误
    验证控件网页代码分析3
    VB自动把变量改成小写
    maven + eclipse + tomcat 实战JSP
    Java 多线程初探(一) 创建线程
    WebSocket简单使用(一) 概念
    JDBC的事务操作
  • 原文地址:https://www.cnblogs.com/guoguolan/p/5607556.html
Copyright © 2011-2022 走看看