Ransom Note1 [Leetcode][자바스크립트][Easy] 383. Ransom Note 풀이 /** * 383_RansomNote.js * Easy * https://leetcode.com/problems/ransom-note/ */ var canConstruct = function(ransomNote, magazine) { const mHash = {}; magazine.split("").forEach((char) => { if (!mHash[char]) { mHash[char] = 1; } else { mHash[char]++; } }); for (let i = 0; i < ransomNote.length; i++) { if (!mHash[ransomNote[i]]) return false; mHash[ransomNote[i]]--; } return true; }; ransomNote .. 2022. 1. 10. 이전 1 다음
