| | 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.MinimumNumberOfArrowsToBurstBalloons; |
| | 13 | |
|
| | 14 | | /// <inheritdoc /> |
| | 15 | | public class MinimumNumberOfArrowsToBurstBalloonsIterative : IMinimumNumberOfArrowsToBurstBalloons |
| | 16 | | { |
| | 17 | | /// <summary> |
| | 18 | | /// Time complexity - O(n log n) |
| | 19 | | /// Space complexity - O(n) |
| | 20 | | /// </summary> |
| | 21 | | /// <param name="points"></param> |
| | 22 | | /// <returns></returns> |
| | 23 | | public int FindMinArrowShots(int[][] points) |
| 4 | 24 | | { |
| 4 | 25 | | var arrowShotsCount = 1; |
| | 26 | |
|
| 26 | 27 | | var orderedPoints = points.OrderBy(p => p[1]).ToArray(); |
| | 28 | |
|
| 4 | 29 | | var previousPoint = orderedPoints[0]; |
| | 30 | |
|
| 56 | 31 | | foreach (var point in orderedPoints) |
| 22 | 32 | | { |
| 22 | 33 | | if (point[0] <= previousPoint[1]) |
| 16 | 34 | | { |
| 16 | 35 | | continue; |
| | 36 | | } |
| | 37 | |
|
| 6 | 38 | | arrowShotsCount++; |
| 6 | 39 | | previousPoint = point; |
| 6 | 40 | | } |
| | 41 | |
|
| 4 | 42 | | return arrowShotsCount; |
| 4 | 43 | | } |
| | 44 | | } |