public T[] DeleteNode_Encrypt(int key)
{
CircleLinkNode <T> current1 = head;
CircleLinkNode <T> current2 = head;
T[] Data = new T[length];
for (int i = 0; i < length; i++)
{
for (int j = 1; j < key; j++)
{
current1 = current2;
current2 = current2.Next;
}
current1.Next = current2.Next;
Data[i] = current2.Data;
current2 = current1.Next;
}
return(Data);
}
public void AppendNode(T a)
{
if (head == null)
{
head = new CircleLinkNode <T>(a);
head.Next = head;
length++;
return;
}
CircleLinkNode <T> current = head;
CircleLinkNode <T> newnode = new CircleLinkNode <T>(a);
for (int i = 0; i < length - 1; i++)
{
current = current.Next;
}
current.Next = newnode;
newnode.Next = this.Head;
length++;
}
public CircleLinkNode()
{
data = default(T);
next = null;
}
public CircleLinkNode(CircleLinkNode <T> p)
{
next = p;
}
public CircleLinkNode(T val, CircleLinkNode <T> p)
{
data = val;
next = p;
}
public CircleLinkList()
{
this.head = null;
}
