public void ReverseLinkedListTests2()
{
int[] head = new int[] { };
int[] tail = new int[] { };
InternalTest(ListNode.FromArray(head), ListNode.FromArray(tail));
}
public void SortListTests1()
{
ListNode head = ListNode.FromArray(new int[] { 4, 2, 1, 3 });
ListNode expected = ListNode.FromArray(new int[] { 1, 2, 3, 4 });
InternalTest(head, expected);
}
public void ReverseLinkedListTests1()
{
int[] head = new int[] { 1, 2, 3, 4, 5 };
int[] tail = new int[] { 5, 4, 3, 2, 1 };
InternalTest(ListNode.FromArray(head), ListNode.FromArray(tail));
}
public void SortListTests2()
{
ListNode head = ListNode.FromArray(new int[] { -1, 5, 3, 4, 0 });
ListNode expected = ListNode.FromArray(new int[] { -1, 0, 3, 4, 5 });
InternalTest(head, expected);
}
public void RemoveNthNodeTests3()
{
ListNode head = ListNode.FromArray(new int[] { 1, 2 });
ListNode expected = ListNode.FromArray(new int[] { 1 });
InternalTest(head, 1, expected);
}
public void RemoveNthNodeTests1()
{
ListNode head = ListNode.FromArray(new int[] { 1, 2, 3, 4, 5 });
ListNode expected = ListNode.FromArray(new int[] { 1, 2, 3, 5 });
InternalTest(head, 2, expected);
}
public void TestCase2()
{
var head = ListNode.FromArray(new int[] { -1, 5, 3, 4, 0 });
var expected = ListNode.FromArray(new int[] { -1, 0, 3, 4, 5 });
var actual = sln.SortList(head);
Assert.True(LinkedListEquals(expected, actual));
}
public void TestCase1()
{
var head = ListNode.FromArray(new int[] { 4, 2, 1, 3 });
var expected = ListNode.FromArray(new int[] { 1, 2, 3, 4 });
var actual = sln.SortList(head);
Assert.True(LinkedListEquals(expected, actual));
}
public void MergeTwoSortedListsTests1()
{
ListNode l1 = ListNode.FromArray(new int[] { 1, 2, 4 });
ListNode l2 = ListNode.FromArray(new int[] { 1, 3, 4 });
ListNode expected = ListNode.FromArray(new int[] { 1, 1, 2, 3, 4, 4 });
InternalTest(l1, l2, expected);
}
public void TestCase4()
{
var l1 = ListNode.FromArray(new int[] { 9, 9, 9, 9 });
var l2 = ListNode.FromArray(new int[] { 9, 9, 9, 9 });
var expected = ListNode.FromArray(new int[] { 8, 9, 9, 9, 1 });
var actual = sln.AddTwoNumbers(l1, l2);
Assert.True(LinkedListEquals(expected, actual));
}
public void TestCase1()
{
var l1 = ListNode.FromArray(new int[] { 2, 4, 3 });
var l2 = ListNode.FromArray(new int[] { 5, 6, 4 });
var expected = ListNode.FromArray(new int[] { 7, 0, 8 });
var actual = sln.AddTwoNumbers(l1, l2);
Assert.True(LinkedListEquals(expected, actual));
}
public void TestDifferentLength()
{
var l1 = ListNode.FromArray(new int[] { 1, 3, 5, 7 });
var l2 = ListNode.FromArray(new int[] { 2, 4, 6 });
var expected = ListNode.FromArray(new int[] { 1, 2, 3, 4, 5, 6, 7 });
var actual = sln.MergeTwoLists(l1, l2);
Assert.True(LinkedListEquals(expected, actual));
}
public void MergeKSortedListTests1()
{
List <ListNode> lists = new List <ListNode>
{
ListNode.FromArray(new int[] { 1, 4, 5 }),
ListNode.FromArray(new int[] { 1, 3, 4 }),
ListNode.FromArray(new int[] { 2, 6 })
};
InternalTest(lists.ToArray(), "1->1->2->3->4->4->5->6");
}
void InternalTest(int[] array, bool expected)
{
bool actual = PalindromeLinkedList.IsPalindrome(ListNode.FromArray(array));
Assert.Equal <bool>(expected, actual);
}
