| | | 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.ImplementStackUsingQueues; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class ImplementStackUsingQueuesTwoQueues : IImplementStackUsingQueues |
| | | 16 | | { |
| | 7 | 17 | | private readonly Queue<int> _queue1 = new(); |
| | 7 | 18 | | private readonly Queue<int> _queue2 = new(); |
| | | 19 | | |
| | | 20 | | /// <summary> |
| | | 21 | | /// Time complexity - O(n) |
| | | 22 | | /// Space complexity - O(n) |
| | | 23 | | /// </summary> |
| | | 24 | | /// <param name="x"></param> |
| | | 25 | | public void Push(int x) |
| | 15 | 26 | | { |
| | 15 | 27 | | if (_queue1.Count > 0) |
| | 5 | 28 | | { |
| | 5 | 29 | | _queue2.Enqueue(x); |
| | | 30 | | |
| | 12 | 31 | | while (_queue1.Count > 0) |
| | 7 | 32 | | { |
| | 7 | 33 | | _queue2.Enqueue(_queue1.Dequeue()); |
| | 7 | 34 | | } |
| | 5 | 35 | | } |
| | | 36 | | else |
| | 10 | 37 | | { |
| | 10 | 38 | | _queue1.Enqueue(x); |
| | | 39 | | |
| | 18 | 40 | | while (_queue2.Count > 0) |
| | 8 | 41 | | { |
| | 8 | 42 | | _queue1.Enqueue(_queue2.Dequeue()); |
| | 8 | 43 | | } |
| | 10 | 44 | | } |
| | 15 | 45 | | } |
| | | 46 | | |
| | | 47 | | /// <summary> |
| | | 48 | | /// Time complexity - O(1) |
| | | 49 | | /// Space complexity - O(n) |
| | | 50 | | /// </summary> |
| | | 51 | | /// <returns></returns> |
| | | 52 | | public int Pop() |
| | 9 | 53 | | { |
| | 9 | 54 | | return _queue1.Count > 0 ? _queue1.Dequeue() : _queue2.Dequeue(); |
| | 9 | 55 | | } |
| | | 56 | | |
| | | 57 | | /// <summary> |
| | | 58 | | /// Time complexity - O(1) |
| | | 59 | | /// Space complexity - O(n) |
| | | 60 | | /// </summary> |
| | | 61 | | /// <returns></returns> |
| | | 62 | | public int Top() |
| | 5 | 63 | | { |
| | 5 | 64 | | return _queue1.Count > 0 ? _queue1.Peek() : _queue2.Peek(); |
| | 5 | 65 | | } |
| | | 66 | | |
| | | 67 | | /// <summary> |
| | | 68 | | /// Time complexity - O(1) |
| | | 69 | | /// Space complexity - O(n) |
| | | 70 | | /// </summary> |
| | | 71 | | /// <returns></returns> |
| | | 72 | | public bool Empty() |
| | 4 | 73 | | { |
| | 4 | 74 | | return _queue1.Count == 0 && _queue2.Count == 0; |
| | 4 | 75 | | } |
| | | 76 | | } |