LeetCode //C - 1283. Find the Smallest Divisor Given a Threshold

1283. Find the Smallest Divisor Given a Threshold

Given an array of integers nums and an integer threshold, we will choose a positive integer divisor, divide all the array by it, and sum the division's result. Find the smallest divisor such that the result mentioned above is less than or equal to threshold.

Each result of the division is rounded to the nearest integer greater than or equal to that element. (For example: 7/3 = 3 and 10/2 = 5).

The test cases are generated so that there will be an answer.

Example 1:

Input: nums = 1,2,5,9, threshold = 6

Output: 5

Explanation: We can get a sum to 17 (1+2+5+9) if the divisor is 1.

If the divisor is 4 we can get a sum of 7 (1+1+2+3) and if the divisor is 5 the sum will be 5 (1+1+1+2).ou can split the string into "ab" and "c", and change 1 character in "ab" to make it palindrome.

Example 2:

Input: s = "aabbc", k = 3

Output: 0

Explanation: You can split the string into "aa", "bb" and "c", all of them are palindrome.

Example 3:

Input: s = "leetcode", k = 8

Output: 0

Constraints:
  • 1 < = n u m s . l e n g t h < = 5 ∗ 10 4 1 <= nums.length <= 5 * 10^4 1<=nums.length<=5∗104
  • 1 < = n u m s i < = 10 6 1 <= numsi <= 10^6 1<=numsi<=106
  • n u m s . l e n g t h < = t h r e s h o l d < = 10 6 nums.length <= threshold <= 10^6 nums.length<=threshold<=106

From: LeetCode

Link: 1283. Find the Smallest Divisor Given a Threshold


Solution:

Ideas:

Use binary search on the divisor. For each divisor, calculate the rounded-up sum using (numsi + divisor - 1) / divisor.

Code:
c 复制代码
int smallestDivisor(int* nums, int numsSize, int threshold) {
    int left = 1;
    int right = 0;

    for (int i = 0; i < numsSize; i++) {
        if (nums[i] > right) {
            right = nums[i];
        }
    }

    while (left < right) {
        int mid = left + (right - left) / 2;
        long long sum = 0;

        for (int i = 0; i < numsSize; i++) {
            sum += (nums[i] + mid - 1) / mid;

            if (sum > threshold) {
                break;
            }
        }

        if (sum <= threshold) {
            right = mid;
        } else {
            left = mid + 1;
        }
    }

    return left;
}
相关推荐
Pniubi4 小时前
01背包类问题-力扣416.分割等和子集
算法·leetcode·职场和发展
文丑颜不良啊15 小时前
LeetCode3041~3060题目解析
java·leetcode
罗西的思考15 小时前
【轻量化复现大模型 / KIMI K3】MTP / EAGLE‑3 模块交互式演示
人工智能·深度学习·算法
文丑颜不良啊16 小时前
LeetCode3101~3120题目解析
java·leetcode
kyle~19 小时前
模型预测控制(MPC)
算法·机器人·控制·传感器
老花眼猫20 小时前
C语言绘图方法:(10)椭圆缩放旋转
c语言·经验分享·青少年编程·课程设计
牢姐与蒯21 小时前
cpp算法之哈希
c++·算法·哈希算法
开开心心就好1 天前
两张表格数据对比工具,不用写函数也能查
算法·spring·智能手机·pdf·电脑·intellij-idea·音视频
电科_银尘1 天前
【大模型算法与工程 02】线性回归与逻辑回归:从损失函数到决策边界
算法·逻辑回归·线性回归
玄昌盛不会编程1 天前
LeetCode——2243. 计算字符串的数字和
java·算法·leetcode