cs: add «2270. Number of Ways to Split Array»

URL:	https://leetcode.com/problems/number-of-ways-to-split-array/
Signed-off-by: Matej Focko <me@mfocko.xyz>
This commit is contained in:
Matej Focko 2025-01-03 10:29:36 +01:00
parent 7e297a3605
commit 3a4809d6f8
Signed by: mfocko
SSH key fingerprint: SHA256:icm0fIOSJUpy5+1x23sfr+hLtF9UhY8VpMC7H4WFJP8

View file

@ -0,0 +1,17 @@
public class Solution {
public int WaysToSplitArray(int[] nums) {
var (leftSum, rightSum) = (0l, nums.Select(x => (long)x).Sum());
var count = 0;
for (var i = 0; i < nums.Length - 1; ++i) {
leftSum += nums[i];
rightSum -= nums[i];
if (leftSum >= rightSum) {
++count;
}
}
return count;
}
}