计算数组中重复的数字并返回 true（认知复杂性）

Question

I need to check if a number repeats itself at least three times in an array. How can I refactor it to decrease the Cognitive Complexity that Lint keeps complaining about.

Heres my code:

let array11 = [1, 3, 2, 3, 5, 6, 7, 8, 9, 0, 1]; 

function checkDuplicateNumber (array11) {
     for (let i = 0; i < array11.length; i += 1) {
        let sameNumberLoop = 0;
        for (let i2 = i; i2 < array11.length; i2 += 1) {
          if (array11[i] === array11[i2]) {
            sameNumberLoop += 1;
            if (sameNumberLoop >= 3) {
              return true;
            }
          }
        }
      }

}

Answer 1

Instead of iterating multiple times, iterate just once, while counting up the number of occurrences in an object or Map:

 let array11 = [1, 3, 2, 3, 5, 6, 7, 8, 9, 0, 1]; function checkDuplicateNumber (array) { const counts = {}; for (const num of array) { counts[num] = (counts[num] || 0) + 1; if (counts[num] === 3) return true; } return false; }; console.log(checkDuplicateNumber(array11)); console.log(checkDuplicateNumber([3, 1, 3, 5, 3]));

Answer 2

 let array11 = [1, 3, 2, 3, 5, 6, 7, 8, 9, 0, 1] let array22 = [1, 3, 2, 3, 5, 6, 7, 1, 9, 0, 1] function checkDuplicateNumber(arr) { const map = new Map() return arr.some((v) => (map.has(v)? (++map.get(v).count === 3): (map.set(v, { count: 1 }), false))) } console.log(checkDuplicateNumber(array11)) console.log(checkDuplicateNumber(array22))