public DLinkedList <T> NewList(int j)
{
DLinkedList <T> NewList = new DLinkedList <T>();
NewList.Add(0);
Node <T> NewCur = NewList.head;
Node <T> current = head;
int counter = 0;
while (counter != j)
{
counter++;
current = current.Next;
}
j = current.Data;
current = head;
while (counter != count)
{
NewCur.Data = j * (count - current.Data);
counter++;
NewList.Add(0);
NewCur = NewCur.Next;
}
return(NewList);
}
public Node <T>[] Divide()
{
Node <T> current = head;
DLinkedList <T> multipleThree = new DLinkedList <T>();
DLinkedList <T> normalDigits = new DLinkedList <T>();
while (current != null)
{
if (current.Data % 3 == 0)
{
multipleThree.Add(current.Data);
}
else
{
normalDigits.Add(current.Data);
}
current = current.Next;
}
return(new Node <T>[] { multipleThree.head, normalDigits.head });
}