| | | 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.MinimumNumberOfOperationsToMoveAllBallsToEachBox; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MinimumNumberOfOperationsToMoveAllBallsToEachBoxTwoPass : IMinimumNumberOfOperationsToMoveAllBallsToEachBox |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="boxes"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int[] MinOperations(string boxes) |
| | 2 | 24 | | { |
| | 2 | 25 | | var result = new int[boxes.Length]; |
| | | 26 | | |
| | 2 | 27 | | var count = 0; |
| | 2 | 28 | | var moves = 0; |
| | | 29 | | |
| | 22 | 30 | | for (var i = 0; i < boxes.Length; i++) |
| | 9 | 31 | | { |
| | 9 | 32 | | result[i] += moves; |
| | | 33 | | |
| | 9 | 34 | | if (boxes[i] == '1') |
| | 5 | 35 | | { |
| | 5 | 36 | | count++; |
| | 5 | 37 | | } |
| | | 38 | | |
| | 9 | 39 | | moves += count; |
| | 9 | 40 | | } |
| | | 41 | | |
| | 2 | 42 | | count = 0; |
| | 2 | 43 | | moves = 0; |
| | | 44 | | |
| | 22 | 45 | | for (var i = boxes.Length - 1; i >= 0; i--) |
| | 9 | 46 | | { |
| | 9 | 47 | | result[i] += moves; |
| | | 48 | | |
| | 9 | 49 | | if (boxes[i] == '1') |
| | 5 | 50 | | { |
| | 5 | 51 | | count++; |
| | 5 | 52 | | } |
| | | 53 | | |
| | 9 | 54 | | moves += count; |
| | 9 | 55 | | } |
| | | 56 | | |
| | 2 | 57 | | return result; |
| | 2 | 58 | | } |
| | | 59 | | } |