/// <summary>
/// An iterative method to find the middle value of the linked list
/// </summary>
/// <returns></returns>
public Dictionary <int, int[]> FindTheMiddle()
{
Sum3Node current = Head;
Sum3Node runner = Head;
while (runner != null && runner.Next != null)
{
runner = runner.Next.Next;
current = current.Next;
}
return(current.Value);
}
/// <summary>
/// An insertion method that adds a Sum3Node anywhere on the linked list
/// </summary>
/// <param name="value"></param>
/// <param name="index"></param>
public void Insert(Dictionary <int, int[]> value, int index)
{
Sum3Node current = Head;
Sum3Node Sum3Node = new Sum3Node(value);
while (index > 1 || current.Next != null)
{
current = current.Next;
index--;
}
Sum3Node.Next = current.Next;
current.Next = Sum3Node;
}
///// <summary>
///// This method partitions the linked list into even and odd sections
///// This partition has the evens first then the odds.
///// </summary>
//public void Partition()
//{
// Sum3Node current = Head;
// while (current.Next != null)
// {
// Sum3Node temp = current.Next;
// if (current.Next.Value % 2 == 0)
// {
// current.Next = current.Next.Next;
// temp.Next = Head;
// Head = temp;
// }
// else
// {
// current = current.Next;
// }
// }
//}
/// <summary>
/// A method to remove a Sum3Node from the linked list
/// </summary>
/// <param name="value"></param>
public void Remove(Dictionary <int, int[]> value)
{
Sum3Node current = Head;
if (value == current.Value)
{
Head = current.Next;
}
while (current.Next.Next != null)
{
if (value == current.Next.Value)
{
current.Next = current.Next.Next;
}
}
}
/// <summary>
/// This method finds the value of the Kth Sum3Node from the end of the linked list
/// </summary>
/// <param name="k"></param>
/// <returns></returns>
public Dictionary <int, int[]> KthLast(int k)
{
Sum3Node current = Head;
Sum3Node runner = Head;
while (k > 0)
{
runner = runner.Next;
k--;
}
while (runner.Next != null)
{
runner = runner.Next;
current = current.Next;
}
return(current.Value);
}
/// <summary>
/// This method reverses the linked list
/// </summary>
public void Reverse()
{
Sum3Node current = Head;
Sum3Node runner = current.Next;
current.Next = null;
if (runner == null)
{
return;
}
while (runner.Next != null)
{
Sum3Node temp = runner.Next;
runner.Next = current;
current = runner;
runner = temp;
}
runner.Next = current;
Head = runner;
}
