public void TestSortList() { int[] nums = { 4, 2, 1, 3 }; ListNode l1 = ListNode.CreateListNode(nums); ReverseLinkedList.SortList(l1); }
public void TestDeleteDuplicates2() { int[] nums = { 1, 1, 1, 2, 3 }; ListNode l1 = ListNode.CreateListNode(nums); ReverseLinkedList.DeleteDuplicates2(l1); }
public void TestReverseKGroup() { int[] nums = { 1, 2, 3, 4, 5 }; ListNode l1 = ListNode.CreateListNode(nums); ReverseLinkedList.ReverseKGroup(l1, 3); }
public void TestDeleteDuplicates() { int[] nums = { 1, 1, 2 }; ListNode head = ListNode.CreateListNode(nums); ReverseLinkedList.DeleteDuplicates(head); }
public void TestAddTwoNumbers() { int[] nums = { 7, 2, 4, 3 }; int[] nums2 = { 5, 6, 4 }; ListNode l1 = ListNode.CreateListNode(nums); ListNode l2 = ListNode.CreateListNode(nums2); ReverseLinkedList.AddTwoNumbers(l1, l2); }
public void AddTwoNumbers_Case3() { // Arrange AddTwoNumbersProblem obj = new AddTwoNumbersProblem(); var l1 = ListNode.CreateListNode(9, 9, 9, 9, 9, 9, 9); var l2 = ListNode.CreateListNode(9, 9, 9, 9); var expected = ListNode.CreateListNode(8, 9, 9, 9, 0, 0, 0, 1); // Act var actual = obj.AddTwoNumbers(l1, l2); // Assert Assert.Equal(expected, actual); }
public void AddTwoNumbers_Case1() { // Arrange AddTwoNumbersProblem obj = new AddTwoNumbersProblem(); var l1 = ListNode.CreateListNode(2, 4, 3); var l2 = ListNode.CreateListNode(5, 6, 4); var expected = ListNode.CreateListNode(7, 0, 8); // Act var actual = obj.AddTwoNumbers(l1, l2); // Assert Assert.Equal(expected, actual); }
public void MergeTwoSortedListsProblem_Case3() { // Arrange var obj = new MergeTwoSortedListsProblem(); var l1 = ListNode.CreateListNode(); var l2 = ListNode.CreateListNode(0); var expected = ListNode.CreateListNode(0); // Act ListNode actual = obj.MergeTwoLists(l1, l2); // Assert Assert.Equal(expected, actual); }