leetcode [41] 缺失的第一个正数 /** * @param {number[]} nums * @return {number} */ var firstMissingPositive = function(nums) { let res = 0 let len = nums.length let set = new Set(nums) while(set.has(++res) && res <= len) { continue } return res }