add 2270

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty  | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------
+| 2270  |[Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2270.java)                                                                     || Medium                                                                        ||
 | 2269 |[Find the K-Beauty of a Number](https://leetcode.com/problems/find-the-k-beauty-of-a-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2269.java)                                                                     || Easy                                                                          ||
 | 2264 |[Largest 3-Same-Digit Number in String](https://leetcode.com/problems/largest-3-same-digit-number-in-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2264.java)                                                                     || Easy                                                                          ||
 | 2260 |[Minimum Consecutive Cards to Pick Up](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2260.java)                                                                     || Medium                                                                        ||

src/main/java/com/fishercoder/solutions/_2270.java

@@ -0,0 +1,30 @@
+package com.fishercoder.solutions;
+
+public class _2270 {
+    public static class Solution1 {
+        public int waysToSplitArray(int[] nums) {
+            long[] presum = new long[nums.length];
+            for (int i = 0; i < nums.length; i++) {
+                if (i == 0) {
+                    presum[i] = nums[i];
+                } else {
+                    presum[i] = presum[i - 1] + nums[i];
+                }
+            }
+            int ways = 0;
+            long firstHalf = presum[0];
+            long secondHalf = presum[nums.length - 1] - presum[0];
+            for (int i = 0; i < nums.length - 1; ) {
+                if (firstHalf >= secondHalf) {
+                    ways++;
+                }
+                i++;
+                if (i < nums.length - 1) {
+                    firstHalf = presum[i];
+                    secondHalf = presum[nums.length - 1] - presum[i];
+                }
+            }
+            return ways;
+        }
+    }
+}