refactor 1013

fishercoder1534 · fishercoder1534 · commit d215a49a5e3c · 2020-08-06T15:18:29.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1013.java b/src/main/java/com/fishercoder/solutions/_1013.java
@@ -1,30 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 1013. Partition Array Into Three Parts With Equal Sum
- *
- * Given an array A of integers, return true if and only if we can partition the array into three non-empty parts with equal sums.
- * Formally, we can partition the array if we can find indexes i+1 < j with
- * (A[0] + A[1] + ... + A[i] == A[i+1] + A[i+2] + ... + A[j-1] == A[j] + A[j-1] + ... + A[A.length - 1])
- *
- * Example 1:
- * Input: [0,2,1,-6,6,-7,9,1,2,0,1]
- * Output: true
- * Explanation: 0 + 2 + 1 = -6 + 6 - 7 + 9 + 1 = 2 + 0 + 1
- *
- * Example 2:
- * Input: [0,2,1,-6,6,7,9,-1,2,0,1]
- * Output: false
- *
- * Example 3:
- * Input: [3,3,6,5,-2,2,5,1,-9,4]
- * Output: true
- * Explanation: 3 + 3 = 6 = 5 - 2 + 2 + 5 + 1 - 9 + 4
- *
- * Note:
- *
- * 3 <= A.length <= 50000
- * -10000 <= A[i] <= 10000*/
 public class _1013 {
     public static class Solution1 {
         public boolean canThreePartsEqualSum(int[] A) {
