java.lang.Object
g2201_2300.s2270_number_of_ways_to_split_array.Solution

public class Solution extends Object
2270 - Number of Ways to Split Array.<p>Medium</p> <p>You are given a <strong>0-indexed</strong> integer array <code>nums</code> of length <code>n</code>.</p> <p><code>nums</code> contains a <strong>valid split</strong> at index <code>i</code> if the following are true:</p> <ul> <li>The sum of the first <code>i + 1</code> elements is <strong>greater than or equal to</strong> the sum of the last <code>n - i - 1</code> elements.</li> <li>There is <strong>at least one</strong> element to the right of <code>i</code>. That is, <code>0 <= i < n - 1</code>.</li> </ul> <p>Return <em>the number of <strong>valid splits</strong> in</em> <code>nums</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [10,4,-8,7]</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> There are three ways of splitting nums into two non-empty parts:</p> <ul> <li> <p>Split nums at index 0. Then, the first part is [10], and its sum is 10. The second part is [4,-8,7], and its sum is 3. Since 10 >= 3, i = 0 is a valid split.</p> </li> <li> <p>Split nums at index 1. Then, the first part is [10,4], and its sum is 14. The second part is [-8,7], and its sum is -1. Since 14 >= -1, i = 1 is a valid split.</p> </li> <li> <p>Split nums at index 2. Then, the first part is [10,4,-8], and its sum is 6. The second part is [7], and its sum is 7. Since 6 < 7, i = 2 is not a valid split. Thus, the number of valid splits in nums is 2.</p> </li> </ul> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [2,3,1,0]</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> There are two valid splits in nums:</p> <ul> <li> <p>Split nums at index 1. Then, the first part is [2,3], and its sum is 5. The second part is [1,0], and its sum is 1. Since 5 >= 1, i = 1 is a valid split.</p> </li> <li> <p>Split nums at index 2. Then, the first part is [2,3,1], and its sum is 6. The second part is [0], and its sum is 0. Since 6 >= 0, i = 2 is a valid split.</p> </li> </ul> <p><strong>Constraints:</strong></p> <ul> <li><code>2 <= nums.length <= 10<sup>5</sup></code></li> <li><code>-10<sup>5</sup> <= nums[i] <= 10<sup>5</sup></code></li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • waysToSplitArray

      public int waysToSplitArray(int[] nums)