René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/super-ugly-number","name":"#313 - Super Ugly Number - LeetCode JavaScript Solutions","description":"A super ugly number is a positive integer whose prime factors are in the array primes. Given an integer n and an array of integers primes, r...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number} n\n * @param {number[]} primes\n * @return {number}\n */\nvar nthSuperUglyNumber = function(n, primes) {\n  const result = [1];\n  const pointers = new Array(primes.length).fill(0);\n  const next = [...primes];\n\n  while (result.length < n) {\n    const min = Math.min(...next);\n    result.push(min);\n\n    for (let i = 0; i < primes.length; i++) {\n      if (next[i] === min) {\n        pointers[i]++;\n        next[i] = primes[i] * result[pointers[i]];\n      }\n    }\n  }\n\n  return result[n - 1];\n};","keywords":"LeetCode 313, #313 - Super Ugly Number, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}