[LeetCode] 2270. Number of Ways to Split Array (Python)
·
알고리즘/LeetCode
난이도: Medium 문제 설명You are given a 0-indexed integer array nums of length n.nums contains a valid split at index i if the following are true:The sum of the first i + 1 elements is greater than or equal to the sum of the last n - i - 1 elements.There is at least one element to the right of i. That is, 0 Return the number of valid splits in nums. 문제 예제Example 1:Input: nums = [10,4,-8,7]Output: 2Expl..