public void Max_119_9()
{
SingleLinkedList <int> list = new SingleLinkedList <int>();
list.InsertAtEnd(1);
list.InsertAtEnd(1);
list.InsertAtEnd(9);
int?max = list.Max().GetValueOrDefault(0);
Assert.AreEqual(9, max);
}
public void Find4_123_ReturnsNull()
{
SingleLinkedList <int> list = new SingleLinkedList <int>();
list.InsertAtEnd(1);
list.InsertAtEnd(2);
list.InsertAtEnd(3);
Cell <int>?cell = list.Find(4);
Assert.IsNull(cell);
}
public void Find2_123_ReturnsCellWith2()
{
SingleLinkedList <int> list = new SingleLinkedList <int>();
list.InsertAtEnd(1);
list.InsertAtEnd(2);
list.InsertAtEnd(3);
Cell <int>?cell = list.Find(2);
Assert.AreEqual(2, cell?.Value);
}
public void IterateAfterInsertAtEnd_SingleLinkedList_InProperOrder()
{
SingleLinkedList <int> list = new SingleLinkedList <int>();
list.InsertAtEnd(1);
list.InsertAtEnd(2);
list.InsertAtEnd(3);
int[] numbers = list.ToArray();
Assert.AreEqual(new int[] { 1, 2, 3 }, numbers);
}
public void ContainsLoopHash_7154_false()
{
SingleLinkedList <int> list = new SingleLinkedList <int>();
list.InsertAtEnd(7);
list.InsertAtEnd(1);
list.InsertAtEnd(5);
list.InsertAtEnd(4);
var cyclic = list.ContainsLoopHashSet();
Assert.IsFalse(cyclic);
}
public void FiveToLast_EmptyList_error()
{
SingleLinkedList <int> list = new SingleLinkedList <int>();
list.InsertAtEnd(7);
list.InsertAtEnd(1);
list.InsertAtEnd(5);
list.InsertAtEnd(4);
Assert.Throws <IndexOutOfRangeException>(
() => list.KthToLast(5)
);
}
public void KToLast_7154_Expected(int k, int expect)
{
SingleLinkedList <int> list = new SingleLinkedList <int>();
list.InsertAtEnd(7);
list.InsertAtEnd(1);
list.InsertAtEnd(5);
list.InsertAtEnd(4);
int kth = list.KthToLast(k);
Assert.AreEqual(expect, kth);
}
public void Delete4_123_Returns123()
{
SingleLinkedList <int> list = new SingleLinkedList <int>();
list.InsertAtEnd(1);
list.InsertAtEnd(2);
list.InsertAtEnd(3);
list.Delete(4);
int[] numbers = list.ToArray();
Assert.AreEqual(new int[] { 1, 2, 3 }, numbers);
}
public void Clone_123_Equals123()
{
SingleLinkedList <int> list = new SingleLinkedList <int>();
list.InsertAtEnd(1);
list.InsertAtEnd(2);
list.InsertAtEnd(3);
var copy = list.Clone();
int[] numbers = list.ToArray();
int[] copyNumbers = copy.ToArray();
Assert.AreEqual(numbers, copyNumbers);
}
public void InsertAtEnd_EmptySingleLinkedList_ReturnsProperValue()
{
SingleLinkedList <int> list = new SingleLinkedList <int>();
list.InsertAtEnd(10);
int[] numbers = list.ToArray();
Assert.AreEqual(10, numbers[0]);
}
public void InsertAtEnd_EmptySingleLinkedList_HasOneValue()
{
SingleLinkedList <int> list = new SingleLinkedList <int>();
list.InsertAtEnd(10);
int[] numbers = list.ToArray();
Assert.AreEqual(1, numbers.Length);
}
public void RemoveDuplicates_71554887_71548()
{
SingleLinkedList <int> list = new SingleLinkedList <int>();
list.InsertAtEnd(7);
list.InsertAtEnd(1);
list.InsertAtEnd(5);
list.InsertAtEnd(5);
list.InsertAtEnd(4);
list.InsertAtEnd(8);
list.InsertAtEnd(8);
list.InsertAtEnd(7);
var cleared = list.RemoveDuplicates();
int[] numbers = cleared.ToArray();
Assert.AreEqual(new int[] { 7, 1, 5, 4, 8 }, numbers);
}
public void SelectionSort_LinkedList_Ordered()
{
SingleLinkedList <int> list = new SingleLinkedList <int>();
list.InsertAtEnd(15);
list.InsertAtEnd(4);
list.InsertAtEnd(21);
list.InsertAtEnd(3);
list.InsertAtEnd(400);
list.InsertAtEnd(21);
var sorted = list.SelectionSort();
int[] numbers = sorted.ToArray();
Assert.AreEqual(new int[] { 3, 4, 15, 21, 21, 400 }, numbers);
}
