codility] TimeComplexity - TapeEquilibrium

*문제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] + ... + A[P − 1]) − (A[P] + A[P + 1] + ... + A[N − 1])|In other words, it is the absolute difference between the sum of the first part and the sum of the second part.For example, consider array A such that:A[0] = 3 A[1] = 1 A[2] = 2 A[3] = 4 A[4] = 3We can spl..........

원문링크 : codility] TimeComplexity - TapeEquilibrium