题目
https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/
思路
遍历数组,使用map记录出现的数据,再次出现时直接返回
解题
/*** @param {number[]} nums* @return {number}*/var findRepeatNumber = function(nums) {const numberMap = {}for (let i = 0; i < nums.length; i++) {if (numberMap[nums[i]]) {return nums[i]}numberMap[nums[i]] = 1}};
