| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 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.PointsThatIntersectWithCars; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class PointsThatIntersectWithCarsLookup : IPointsThatIntersectWithCars |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n * R), where n is the length of nums and R = max(end) - min(start) + 1 |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int NumberOfPoints(IList<IList<int>> nums) |
| | 2 | 24 | | { |
| | 2 | 25 | | Span<bool> lookup = stackalloc bool[100]; |
| | | 26 | | |
| | 14 | 27 | | for (var i = 0; i < nums.Count; i++) |
| | 5 | 28 | | { |
| | 5 | 29 | | var num = nums[i]; |
| | 5 | 30 | | var start = num[0]; |
| | 5 | 31 | | var end = num[1]; |
| | | 32 | | |
| | 50 | 33 | | for (var j = start; j <= end; j++) |
| | 20 | 34 | | { |
| | 20 | 35 | | lookup[j - 1] = true; |
| | 20 | 36 | | } |
| | 5 | 37 | | } |
| | | 38 | | |
| | 2 | 39 | | var result = 0; |
| | | 40 | | |
| | 404 | 41 | | for (var i = 0; i < lookup.Length; i++) |
| | 200 | 42 | | { |
| | 200 | 43 | | if (lookup[i]) |
| | 14 | 44 | | { |
| | 14 | 45 | | result++; |
| | 14 | 46 | | } |
| | 200 | 47 | | } |
| | | 48 | | |
| | 2 | 49 | | return result; |
| | 2 | 50 | | } |
| | | 51 | | } |