Skip to content

Commit 9b16c6d

Browse files
committed
add 3678
1 parent 6777299 commit 9b16c6d

2 files changed

Lines changed: 26 additions & 1 deletion

File tree

javascript/LeetCode/Array/3678.js

Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
/**
2+
* 3678. Smallest Absent Positive Greater Than Average
3+
*
4+
* 從nums中找最小缺少的數字,條件:大於nums中所有元素的平均值
5+
* @param {number[]} nums
6+
* @return {number}
7+
*/
8+
var smallestAbsent = function(nums) {
9+
let avg = nums.reduce((a,b) => (a + b) / nums.length);
10+
let ans = 1;
11+
while(true){
12+
if(ans > avg && !nums.includes(ans)){
13+
return ans;
14+
}
15+
ans++;
16+
}
17+
};
18+
let nums = [3,5];
19+
/*
20+
Output: 6
21+
Explanation:
22+
The average of nums is (3 + 5) / 2 = 8 / 2 = 4.
23+
The smallest absent positive integer greater than 4 is 6.
24+
*/
25+
console.log(smallestAbsent(nums));

javascript/index.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1500,7 +1500,7 @@ var solveQueries = function(nums, queries) {
15001500
}
15011501

15021502
};
1503-
let nums = [1,3,1,4,1,3,2], queries = [0,3,5];
1503+
// let nums = [1,3,1,4,1,3,2], queries = [0,3,5];
15041504
/*
15051505
Output: [2,-1,3]
15061506
Explanation:

0 commit comments

Comments
 (0)