2999. Count the Number of Powerful Integers Hard

1/**
2 * [2999] Count the Number of Powerful Integers
3 *
4 * You are given three integers start, finish, and limit. You are also given a 0-indexed string s representing a positive integer.
5 * A positive integer x is called powerful if it ends with s (in other words, s is a suffix of x) and each digit in x is at most limit.
6 * Return the total number of powerful integers in the range [start..finish].
7 * A string x is a suffix of a string y if and only if x is a substring of y that starts from some index (including 0) in y and extends to the index y.length - 1. For example, 25 is a suffix of 5125 whereas 512 is not.
8 *  
9 * <strong class="example">Example 1:
10 * 
11 * Input: start = 1, finish = 6000, limit = 4, s = "124"
12 * Output: 5
13 * Explanation: The powerful integers in the range [1..6000] are 124, 1124, 2124, 3124, and, 4124. All these integers have each digit <= 4, and "124" as a suffix. Note that 5124 is not a powerful integer because the first digit is 5 which is greater than 4.
14 * It can be shown that there are only 5 powerful integers in this range.
15 * 
16 * <strong class="example">Example 2:
17 * 
18 * Input: start = 15, finish = 215, limit = 6, s = "10"
19 * Output: 2
20 * Explanation: The powerful integers in the range [15..215] are 110 and 210. All these integers have each digit <= 6, and "10" as a suffix.
21 * It can be shown that there are only 2 powerful integers in this range.
22 * 
23 * <strong class="example">Example 3:
24 * 
25 * Input: start = 1000, finish = 2000, limit = 4, s = "3000"
26 * Output: 0
27 * Explanation: All integers in the range [1000..2000] are smaller than 3000, hence "3000" cannot be a suffix of any integer in this range.
28 * 
29 *  
30 * Constraints:
31 * 
32 * 	1 <= start <= finish <= 10^15
33 * 	1 <= limit <= 9
34 * 	1 <= s.length <= floor(log10(finish)) + 1
35 * 	s only consists of numeric digits which are at most limit.
36 * 	s does not have leading zeros.
37 * 
38 */
39pub struct Solution {}
40
41// problem: https://leetcode.com/problems/count-the-number-of-powerful-integers/
42// discuss: https://leetcode.com/problems/count-the-number-of-powerful-integers/discuss/?currentPage=1&orderBy=most_votes&query=
43
44// submission codes start here
45
46impl Solution {
47    pub fn number_of_powerful_int(start: i64, finish: i64, limit: i32, s: String) -> i64 {
48        
49    }
50}
51
52// submission codes end
53
54#[cfg(test)]
55mod tests {
56    use super::*;
57
58    #[test]
59    fn test_2999() {
60    }
61}
62