[TimeComplexity] Codility-TapeEquilibrium

Author: Seogeurim

README.md

@@ -67,7 +67,8 @@
 | 04  |     | [Baekjoon-2748 피보나치 수 2](./src/TimeComplexity/P2748) | DP                        |
 | 05  |     | [Baekjoon-1806 부분합](./src/TimeComplexity/P1806)        | 2-pointer                 |
 | 06  |     | [Codility-Lesson3 FrogJmp](./src/TimeComplexity/FrogJmp)    |      |
-| 06  |     | [Codility-Lesson3 PermMissingElem](./src/TimeComplexity/PermMissingElem)    |      |
+| 07  |     | [Codility-Lesson3 PermMissingElem](./src/TimeComplexity/PermMissingElem)    |      |
+| 08  |     | [Codility-Lesson3 TapeEquilibrium](./src/TimeComplexity/TapeEquilibrium)    |      |
 
 ## Data Structure
 

src/TimeComplexity/TapeEquilibrium/Main.java

@@ -0,0 +1,35 @@
+package TimeComplexity.TapeEquilibrium;
+
+public class Main {
+    public static void main(String[] args) {
+        Solution sol = new Solution();
+        System.out.println(sol.solution(new int[]{1, 2, 3}));
+        System.out.println(sol.solution(new int[]{3, 1, 2, 4, 3}));
+    }
+}
+
+class Solution {
+
+    static int N;
+    static int[] toRight, toLeft;
+
+    public int solution(int[] A) {
+        N = A.length;
+        toRight = new int[N];
+        toLeft = new int[N];
+
+        toRight[0] = A[0];
+        toLeft[N-1] = A[N-1];
+        for (int i = 1; i < N; i++) {
+            toRight[i] = toRight[i-1] + A[i];
+            toLeft[N-i-1] = toLeft[N-i] + A[N-i-1];
+        }
+
+        int ans = Integer.MAX_VALUE;
+        for (int p = 1; p < A.length; p++) {
+            ans = Math.min(ans, Math.abs(toRight[p-1] - toLeft[p]));
+        }
+
+        return ans;
+    }
+}

src/TimeComplexity/TapeEquilibrium/README.md

@@ -0,0 +1,6 @@
+## [Codility - Lesson 3 Time Complexity] TapeEquilibrium
+
+> Detected time complexity : **O(N)**
+
+![image](https://user-images.githubusercontent.com/22045163/101920230-e7bc0600-3c0e-11eb-8d04-7d38cc34f1b7.png)
+![image](https://user-images.githubusercontent.com/22045163/101920286-f6a2b880-3c0e-11eb-9354-efcd279939f8.png)