tags: BiWeekly Contest

BiWeekly Contest 143

3345. Smallest Divisible Digit Product I (Easy)

限制：

• 1 <= n <= 100
• 1 <= t <= 10

Solution

時間複雜度:

$O(n)$

空間複雜度:

$O(1)$

程式碼:

class Solution {
public:
    int digitProdcutCalc(int num) {
        int result = 1;
        while (num) {
            result *= num % 10;
            num /= 10;
        }
        return result;
    }
    int smallestNumber(int n, int t) {

        for (; n <= 100; n++) {
            if (digitProdcutCalc(n) % t == 0)
                return n;
        }
        return -1;
    }
};

---

3346. Maximum Frequency of an Element After Performing Operations I (Medium)

限制：

• 1 <= nums.length <= 105
• 1 <= nums[i] <= 105
• 0 <= k <= 105
• 0 <= numOperations <= nums.length

Solution

時間複雜度:

$O()$

空間複雜度:

$O()$

程式碼:

---

3347. Maximum Frequency of an Element After Performing Operations II (Hard)

限制：

• 1 <= nums.length <= 105
• 1 <= nums[i] <= 109
• 0 <= k <= 109
• 0 <= numOperations <= nums.length

Solution

時間複雜度:

$O()$

空間複雜度:

$O()$

程式碼:

---

3348. Smallest Divisible Digit Product II (Hard)

限制：

• 2 <= num.length <= 2 * 105
• num consists only of digits '0'-'9'.
• num does not contain leading zeros.
• 1 <= t <= 1014

Solution

時間複雜度:

$O()$

空間複雜度:

$O()$

程式碼: