Algorithm/문제풀이
[알고리즘/Swift] Codility - TapeEquilibrium
문제 [Codility] https://app.codility.com/programmers/lessons/3-time_complexity/tape_equilibrium/ A non-empty 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 non-empty parts: A[0], A[1], ..., A[P − 1] and A[P], A[P + 1], ..., A[N − 1]. The difference between the two parts is the value of: |(A[0] + A[1] + ..
