Leetcode Daily Question
@leetcodeDailyQuestionChannel
2.38K
subscribers
517
files
2.65K
links
Why are you asking me to do Leetcode for this CSS job?
Download Telegram
Join
Leetcode Daily Question
2.38K subscribers
Leetcode Daily Question
leetcode.cn
2026-08-25
🟢
3718.smallest-missing-multiple-of-k
🏷️
Tags
#array
#hash_table
Telegraph
smallest-missing-multiple-of-k
给你一个整数数组 nums 和一个整数 k,请返回从 nums 中缺失的、最小的正整数 k 的倍数。 倍数 指能被 k 整除的任意正整数。 示例 1: 输入: nums = [8,2,3,4,6], k = 2 输出: 10 解释: 当 k = 2 时,其倍数为 2、4、6、8、10、12……,其中在 nums 中缺失的最小倍数是 10。 示例 2: 输入: nums = [1,4,7,10,15], k = 5 输出: 5 解释: 当 k = 5 时,其倍数为 5、10、15、20……,其中在 nums…
来源
答案
Leetcode Daily Question
leetcode.com
2026-08-25
🟢
3718.smallest-missing-multiple-of-k
🏷️
Tags
#array
#hash_table
Telegraph
smallest-missing-multiple-of-k
Given an integer
array
nums and an integer k, return the smallest positive multiple of k that is missing from nums. A multiple of k is any positive integer divisible by k. Example 1: Input: nums = [8,2,3,4,6], k = 2 Output: 10 Explanation: The multiples…
Source
Solution