| | | 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.MinimumTimeVisitingAllPoints; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class MinimumTimeVisitingAllPointsIterative : IMinimumTimeVisitingAllPoints |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="points"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int MinTimeToVisitAllPoints(int[][] points) |
| | 2 | 24 | | { |
| | 2 | 25 | | var result = 0; |
| | | 26 | | |
| | 10 | 27 | | for (var i = 0; i < points.Length - 1; i++) |
| | 3 | 28 | | { |
| | 3 | 29 | | var point = points[i]; |
| | 3 | 30 | | var nextPoint = points[i + 1]; |
| | | 31 | | |
| | 3 | 32 | | var dx = Math.Abs(nextPoint[0] - point[0]); |
| | 3 | 33 | | var dy = Math.Abs(nextPoint[1] - point[1]); |
| | | 34 | | |
| | 3 | 35 | | result += Math.Max(dx, dy); |
| | 3 | 36 | | } |
| | | 37 | | |
| | 2 | 38 | | return result; |
| | 2 | 39 | | } |
| | | 40 | | } |