938. Numbers At Most N Given Digit Set

Hard (Khó) C++ Python 🔗 Xem trên LeetCode

📋 Đề Bài

Given an array of digits which is sorted in non-decreasing order. You can write numbers using each digits[i] as many times as we want. For example, if digits = ['1','3','5'], we may write numbers such as '13', '551', and '1351315'.

Return the number of positive integers that can be generated that are less than or equal to a given integer n.

 

Example 1:

Input: digits = ["1","3","5","7"], n = 100
Output: 20
Explanation: 
The 20 numbers that can be written are:
1, 3, 5, 7, 11, 13, 15, 17, 31, 33, 35, 37, 51, 53, 55, 57, 71, 73, 75, 77.

Example 2:

Input: digits = ["1","4","9"], n = 1000000000
Output: 29523
Explanation: 
We can write 3 one digit numbers, 9 two digit numbers, 27 three digit numbers,
81 four digit numbers, 243 five digit numbers, 729 six digit numbers,
2187 seven digit numbers, 6561 eight digit numbers, and 19683 nine digit numbers.
In total, this is 29523 integers that can be written using the digits array.

Example 3:

Input: digits = ["7"], n = 8
Output: 1

 

Constraints:

  • 1 <= digits.length <= 9
  • digits[i].length == 1
  • digits[i] is a digit from '1' to '9'.
  • All the values in digits are unique.
  • digits is sorted in non-decreasing order.
  • 1 <= n <= 109

🧠 Thuật Toán & Kỹ Thuật

Dynamic Programming (Quy hoạch động)String (Chuỗi)
⏱️ Thời gian O(n×m)
💾 Không gian O(n×m)

💻 Lời Giải

C++ 0902-numbers-at-most-n-given-digit-set.cpp 
int memo[11][2][2];

class Solution {
private:
    set<int> set_digits;
    string s;
    int sz;

public:
    int dp(int i, int is_zero, int state) {
        if (i == sz) {
            return !is_zero;
        }
        if (memo[i][is_zero][state] != -1) {
            return memo[i][is_zero][state];
        }
        int ans = 0;
        int lm = (state ? (s[i] - '0') : 9);
        for (int d = 0; d <= lm; ++d) {
            if (set_digits.count(d) || (is_zero && (d == 0))) {
                ans += dp(i + 1, is_zero && (d == 0), state && (d == lm));
            }
        }
        return memo[i][is_zero][state] = ans;
    }

    // 01

    int atMostNGivenDigitSet(vector<string>& digits, int n) {
        // dp(i, state)
        s = to_string(n);
        sz = s.size();

        for (string d : digits) {
            set_digits.insert(stoi(d));
        }

        memset(memo, -1, sizeof(memo));

        return dp(0, 1, 1);
    }
};
Python 0902-numbers-at-most-n-given-digit-set.py 
class Solution:
    def atMostNGivenDigitSet(self, digits: List[str], n: int) -> int:
        dp = [[0 for _ in range(3)] for _ in range(11)]
        
        nums = list(map(int, list(str(n))))
        digits = list(map(int, digits))
        
        for d in digits:
            states = 0
            if d == nums[0]:
                states = 1
            elif d > nums[0]:
                states = 2
            dp[1][states] += 1
        
        sz = len(nums)
        
        for i in range(1, sz):
            for states in range(3):
                if dp[i][states] == 0:
                    continue
                for d in digits:
                    newStates = states
                    if states == 1:
                        if d > nums[i]:
                            newStates = 2
                        elif d < nums[i]:
                            newStates = 0
                    dp[i + 1][newStates] += dp[i][states]
                    
        ans = 0
        
        for i in range(sz + 1):
            szStates = 1 if i == sz else 2
            for states in range(szStates + 1):
                ans += dp[i][states]
                
        return ans