Hash Table1 [Leetcode][Javascript][Easy] 202. Happy Number /** * https://leetcode.com/problems/happy-number/ * @param {number} n * @return {boolean} */ var isHappy = function(n) { var memoize = {}; var happy = n; while (happy !== 1) { var tmp = happy; happy = sumOfSquares(happy); if (memoize[tmp] === undefined) { memoize[tmp] = happy; } else { break; } } if (happy === 1) { return true; } return false; }; function sumOfSquares(n) { return n.toString().sp.. 2021. 7. 8. 이전 1 다음