| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.MinimumPositiveSumSubarray; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MinimumPositiveSumSubarrayPrefixSum : IMinimumPositiveSumSubarray |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n * (r - l + 1)) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <param name="l"></param> |
| | | 23 | | /// <param name="r"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public int MinimumSumSubarray(IList<int> nums, int l, int r) |
| | 3 | 26 | | { |
| | 3 | 27 | | var n = nums.Count; |
| | | 28 | | |
| | 3 | 29 | | var prefixSum = new int[n + 1]; |
| | | 30 | | |
| | 30 | 31 | | for (var i = 0; i < n; i++) |
| | 12 | 32 | | { |
| | 12 | 33 | | prefixSum[i + 1] = prefixSum[i] + nums[i]; |
| | 12 | 34 | | } |
| | | 35 | | |
| | 3 | 36 | | var minimumPositiveSum = int.MaxValue; |
| | | 37 | | |
| | 24 | 38 | | for (var i = 0; i <= n - l; i++) |
| | 9 | 39 | | { |
| | 50 | 40 | | for (var j = l; j <= Math.Min(r, n - i); j++) |
| | 16 | 41 | | { |
| | 16 | 42 | | var sum = prefixSum[i + j] - prefixSum[i]; |
| | | 43 | | |
| | 16 | 44 | | if (sum <= 0) |
| | 6 | 45 | | { |
| | 6 | 46 | | continue; |
| | | 47 | | } |
| | | 48 | | |
| | 10 | 49 | | minimumPositiveSum = Math.Min(minimumPositiveSum, sum); |
| | 10 | 50 | | } |
| | 9 | 51 | | } |
| | | 52 | | |
| | 3 | 53 | | if (minimumPositiveSum == int.MaxValue) |
| | 1 | 54 | | { |
| | 1 | 55 | | return -1; |
| | | 56 | | } |
| | | 57 | | |
| | 2 | 58 | | return minimumPositiveSum; |
| | 3 | 59 | | } |
| | | 60 | | } |