| | | 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.ZigzagGridTraversalWithSkip; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class ZigzagGridTraversalWithSkipSimulation : IZigzagGridTraversalWithSkip |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n*m) |
| | | 19 | | /// Space complexity - O(k) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="grid"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public IList<int> ZigzagTraversal(int[][] grid) |
| | 3 | 24 | | { |
| | 3 | 25 | | var result = new List<int>(); |
| | | 26 | | |
| | 22 | 27 | | for (var i = 0; i < grid.Length; i++) |
| | 8 | 28 | | { |
| | 8 | 29 | | if (i % 2 == 0) |
| | 5 | 30 | | { |
| | 24 | 31 | | for (var j = 0; j < grid[i].Length; j += 2) |
| | 7 | 32 | | { |
| | 7 | 33 | | result.Add(grid[i][j]); |
| | 7 | 34 | | } |
| | 5 | 35 | | } |
| | | 36 | | else |
| | 3 | 37 | | { |
| | 3 | 38 | | var start = grid[i].Length - 1; |
| | | 39 | | |
| | 3 | 40 | | if (grid[i].Length % 2 == 1) |
| | 1 | 41 | | { |
| | 1 | 42 | | start--; |
| | 1 | 43 | | } |
| | | 44 | | |
| | 12 | 45 | | for (var j = start; j >= 0; j -= 2) |
| | 3 | 46 | | { |
| | 3 | 47 | | result.Add(grid[i][j]); |
| | 3 | 48 | | } |
| | 3 | 49 | | } |
| | 8 | 50 | | } |
| | | 51 | | |
| | 3 | 52 | | return result; |
| | 3 | 53 | | } |
| | | 54 | | } |