LeetCodeCSharp/Solutions/Problems/ImplementStackUsingQueues.cs at main · gabaoalb/LeetCodeCSharp · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
namespace Solutions.Problems;

public class MyStack
{
    #region Constructors
    #endregion

    #region Fields
    private Queue<int> queue1 = new();
    private Queue<int> queue2 = new();
    #endregion

    #region Properties
    #endregion

    #region Events
    #endregion

    #region Methods
    public void Push(int x)
    {
        queue1.Enqueue(x);
    }

    public int Pop()
    {
        while (queue1.Count > 1)
            queue2.Enqueue(queue1.Dequeue());

        int result = queue1.Dequeue();
        (queue2, queue1) = (queue1, queue2);
        return result;
    }

    public int Top()
    {
        while (queue1.Count > 1)
            queue2.Enqueue(queue1.Dequeue());

        int result = queue1.Dequeue();
        queue2.Enqueue(result);
        (queue2, queue1) = (queue1, queue2);
        return result;
    }

    public bool Empty() => queue1.Count == 0;
    #endregion
}