- [7kyu]Find the smallest integer
- [LeetCode 41] First Missing Posi
- leetcode 41. First Missing Posit
- leetcode-hard-19期-数组- First Miss
- 41. First Missing Positive(week1
- LeetCode代码分析—— 41. First Missing
- [LeetCode] Smallest Integer Divi
- LeetCode #1334 Find the City Wit
- Codility每周一课：L4 Counting Element
- LeetCode Find K-th Smallest Pair
该算法题来自于 codewars【语言: javascript】，翻译如有误差，敬请谅解~
- 任务
- 找出数组中最小的元素，并返回。
- 例如：
[34, 15, 88, 2] // 返回 2
[34, -345, -1, 100] // 返回 -345
- 解答
- 其一
const findSmallestInt = arr => arr.sort((a,b)=>a-b)[0];
- 其二
const findSmallestInt = arr => Math.min(...arr);
- 其三
const findSmallestInt = arr => Math.min.apply(null, args);
- 其四
const findSmallestInt = arr => arr.reduce((prev, curr) => prev < curr ? prev : curr);
网友评论