사랑하애오

1. 솔루션

<javascript />
const solution = (lines) => { const answer = lines.reduce((a, [x, y]) => { for (let i = Math.min(x, y) + 1; i <= Math.max(x, y); i++) a[i] = a[i] ? a[i] + 1 : 1; return a; }, {}); console.log(Object.values(answer).filter((v) => v > 1).length); return Object.values(answer).filter((v) => v > 1).length; };

2. 솔루션

<javascript />
const solution = (lines) => { let line = new Array(200).fill(0); lines.forEach(([a, b]) => { for (; a < b; a++) line[a + 100]++; }); const answer = line.reduce((a, c) => (c > 1 ? a + 1 : a), 0); console.log(answer); return answer; };
profile

사랑하애오

@사랑하애

포스팅이 좋았다면 "좋아요❤️" 또는 "구독👍🏻" 해주세요!