| | | 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.PartitionArrayIntoThreePartsWithEqualSum; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class PartitionArrayIntoThreePartsWithEqualSumSinglePass : IPartitionArrayIntoThreePartsWithEqualSum |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="arr"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public bool CanThreePartsEqualSum(int[] arr) |
| | 15 | 24 | | { |
| | 15 | 25 | | var totalSum = arr.Sum(); |
| | | 26 | | |
| | 15 | 27 | | if (totalSum % 3 != 0) |
| | 4 | 28 | | { |
| | 4 | 29 | | return false; |
| | | 30 | | } |
| | | 31 | | |
| | 11 | 32 | | var targetSum = totalSum / 3; |
| | 11 | 33 | | var currentSum = 0; |
| | 11 | 34 | | var foundSegments = 0; |
| | | 35 | | |
| | 126 | 36 | | for (var i = 0; i < arr.Length - 1; i++) |
| | 59 | 37 | | { |
| | 59 | 38 | | currentSum += arr[i]; |
| | | 39 | | |
| | 59 | 40 | | if (currentSum != targetSum) |
| | 44 | 41 | | { |
| | 44 | 42 | | continue; |
| | | 43 | | } |
| | | 44 | | |
| | 15 | 45 | | foundSegments++; |
| | 15 | 46 | | currentSum = 0; |
| | | 47 | | |
| | 15 | 48 | | if (foundSegments == 2) |
| | 7 | 49 | | { |
| | 7 | 50 | | return true; |
| | | 51 | | } |
| | 8 | 52 | | } |
| | | 53 | | |
| | 4 | 54 | | return false; |
| | 15 | 55 | | } |
| | | 56 | | } |