LeetCode.Test.CommunityToolKit 4.1.2

一、 判断两列表是否相等

1.方法声明

public static void SequenceEqual(this Assert assert, IList<object> list1, IList<object> list2, string msg)
public static void SequenceEqual2(this Assert assert, IList<IList<int>> list1, IList<IList<int>> list2, string msg)

2.Examples

LeetCode 103题

using LeetCode.CommunityToolKit.Tests;
using Microsoft.VisualStudio.TestTools.UnitTesting;
using System;
using System.Collections.Generic;
using System.Linq;

namespace LeetCode.Tests
{
   [TestClass()]
   public class Solution103Tests
   {
       [TestMethod()]
       [DataRow(new object[]{ 3, 9, 20, null, null, 15, 7 } )]
       public void ZigzagLevelOrderTest(object[] array)
       {
           //Arrange 
           var expected =
               new List<IList<int>> {new List<int>() {3}, new List<int>() {20, 9}, new List<int>() {15, 7}};
           //Act
           var actual = new Solution103().ZigzagLevelOrder(array.CreateTree());

           //Assert
          
           //方法1：拓展方法，对函数返回结果便捷单元测试
           Assert.That.SequenceEqual2(expected, actual, "You are wrong!!!");
           //方法2：各种判断非常复杂而且不准确
            for (int i = 0; i < actual.Count; i++)
           {
               Assert.IsTrue(expected[i].SequenceEqual(actual[i]));
           }
           Assert.AreEqual(expected.Count, expected.Count, "You are wrong!!!");
           var typ = expected.GetType();
           Assert.IsInstanceOfType(actual, typ);

       }
   }
}

二、 判断两树是否相等

1.方法声明

public static void TreeNodeEqual(this Assert assert, TreeNode treeNode1, TreeNode treeNode2, string msg)

2.Examples

LeetCode 106题

using LeetCode.CommunityToolKit.Tests;
using LeetCodeTest.CommunityToolKit;
using Microsoft.VisualStudio.TestTools.UnitTesting;

namespace LeetCode.Tests
{
    [TestClass()]
    
    public class Solution106Tests
    {
        [TestMethod()]
        [DataRow(new int[] { 9, 3, 15, 20, 7 }, new int[] { 9, 3, 15, 20, 7 },new object[]{ 3, 9, 20, null, null, 15, 7 })]
        public void BuildTreeTest(int[] arr1, int[] arr2,object[] exp)
        {
            //Arrange 
            var expected = exp;

            //Act
            var actual = new Solution106().BuildTree(arr1,arr2);

            //Assert
            Assert.That.TreeNodeEqual(actual,expected.CreateTree(),"bad");

        }
    }
}