LeetCode-CSharp/UnitTest/_0025_Reverse_nodes_in_k_group_Test.cs at main · FakeStandard/LeetCode-CSharp · 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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
using Common;
using FluentAssertions;
using Microsoft.VisualStudio.TestTools.UnitTesting;
using Solution._0025.Reverse_nodes_in_k_group;

namespace _0025.Reverse_nodes_in_k_group.Tests
{
    [TestClass()]
    public class _0025_Reverse_nodes_in_k_group_Test
    {
        _0025_Reverse_nodes_in_k_group solution = new _0025_Reverse_nodes_in_k_group();

        [TestMethod()]
        public void ReverseKGroup_Test1()
        {
            // Arrange
            ListNode head = new ListNode().AddNode(new int[] { 1, 2, 3, 4, 5 });
            int k = 2;
            var expected = new ListNode().AddNode(new int[] { 2, 1, 4, 3, 5 });

            // Act
            var actual = solution.ReverseKGroup(head, k);

            // Assert
            actual.Should().BeEquivalentTo(expected);
        }

        [TestMethod()]
        public void ReverseKGroup_Test2()
        {
            // Arrange
            ListNode head = new ListNode().AddNode(new int[] { 1, 2, 3, 4, 5 });
            int k = 3;
            var expected = new ListNode().AddNode(new int[] { 3, 2, 1, 4, 5 });

            // Act
            var actual = solution.ReverseKGroup(head, k);

            // Assert
            actual.Should().BeEquivalentTo(expected);
        }

        [TestMethod()]
        public void ReverseKGroup_Test3()
        {
            // Arrange
            ListNode head = new ListNode().AddNode(new int[] { 1, 2, 3, 4, 5 });
            int k = 1;
            var expected = new ListNode().AddNode(new int[] { 1, 2, 3, 4, 5 });

            // Act
            var actual = solution.ReverseKGroup(head, k);

            // Assert
            actual.Should().BeEquivalentTo(expected);
        }

        [TestMethod()]
        public void ReverseKGroup_Test4()
        {
            // Arrange
            ListNode head = new ListNode().AddNode(new int[] { 1, 2 });
            int k = 2;
            var expected = new ListNode().AddNode(new int[] { 2, 1 });

            // Act
            var actual = solution.ReverseKGroup(head, k);

            // Assert
            actual.Should().BeEquivalentTo(expected);
        }
    }
}