Lesson 3-3 - TapeEquilibrium내용 : Minimize the value |(A[0] + ... + A[P-1]) - (A[P] + ... + A[N-1])|시간 복잡도 : O(N)성공한 코드function solution(A) { // write your code in JavaScript (Node.js 6.4.0) let tot = 0; let rt_val = 100001; let tmp_tot = 0; for(i = 0;i