asked
Introduction to Javascript Algorithm Problem Solving (Coding Test Preparation)
3. Continuous Subsequence 1 (Two Pointers Algorithm)
Resolved
Written on
·
368
0
const sol = (arr, n) => { let p1 = 0, cnt = 0; while (p1 < arr.length) { arr.slice(p1++).reduce((acc, cur) => { const result = acc + cur; if (result === n) cnt++; return result; }, 0); } const answer = cnt; return answer; };
Answer 1
아.. 이건 n^2이군요
안녕하세요^^
네. 맞습니다.
안녕하세요^^
네. 맞습니다.