time complexity1 Lesson 3: Time Complexity [Lesson 3: Time Complexity] Tasks 1. TapeEquilibriumMinimize the value |(A[0] + ... + A[P-1]) - (A[P] + ... + A[N-1])|. 사이트 : https://codility.com/programmers/task/tape_equilibrium/난이도 : PAINLESS추가 자료 : Open reading material (PDF) A non-empty zero-indexed array A consisting of N integers is given. Array A represents numbers on a tape.Any integer P, such that 0 < P < N, splits this tape into two .. 2016. 9. 2. 이전 1 다음