느낌이 다른 풀이 3가지
const singleNumber = function(nums) {
const obj = {}
for (let num of nums) {
obj[num] ? obj[num]++ : obj[num] = 1
}
for (const [k, v] of Object.entries(obj)) {
if (v == 1) {
return k
}
}
};
function singleNumber(nums) {
const map = {};
for (let n of nums) {
if (map[n] == null) map[n] = 0;
map[n]++;
}
for (let n in map) {
if (map[n] === 1) return Number(n);
}
}
const singleNumber = function(nums) {
let hash = {}
for(let val of nums){
hash[val]?delete hash[val]:hash[val]=1;
}
return Object.keys(hash)[0]
};
'알고리즘 > 리트코드' 카테고리의 다른 글
53. Maximum Subarray (0) | 2022.04.05 |
---|---|
187. Repeated DNA Sequences (0) | 2022.04.03 |
127. Word Ladder (0) | 2022.03.31 |
49. Group Anagrams (0) | 2022.03.28 |
48. Rotate Image (0) | 2022.03.28 |