单链表实现栈

最新推荐文章于 2024-09-27 22:28:49 发布

记Dë微(^_^)

最新推荐文章于 2024-09-27 22:28:49 发布

阅读量66

点赞数

文章标签： c# unity 开发语言游戏引擎

本文链接：https://blog.csdn.net/qq_44113825/article/details/131709355

版权

文章介绍了如何使用自定义的MyNode类来构建一个泛型数据结构，并实现了IStack接口，支持Push、Pop和Peek操作。MyStackLinkList类基于链表，维护了一个头结点和计数器，确保栈操作的正确性。

摘要由CSDN通过智能技术生成

1.自定义结构

class MyNode<T>
{
private MyNode<T> next;
private T data;
public MyNode()
{
next = null;
data = default(T);
}
public MyNode(T data)
{
this.data = data;
this.next = null;
}
public MyNode(MyNode<T> next)
{
this.next = next;
this.data = default(T);
}
public MyNode(MyNode<T> next, T data)
{
this.data = data;
this.next = next;
}

public T Data { get { return data; }set { data = value; } }
public MyNode<T> Next { get { return next; }set { next = value; } }

2.使用自定义结构实现接口

public class MyStackLinkList<T> : IStack<T>
{
private MyNode<T> head;
int count = 0;
public MyStackLinkList()
{
head =null;
count = 0;
}
public int GetLength()
{
return count;
}

public T Peek()
{
if (head != null)
{
MyNode<T> temp = head;
while (true)
{
if (temp.Next != null)
{
temp= temp.Next;
}
else
{
return temp.Data;
}
}
}
else
{
return default(T);
}

}

public T Pop()
{
MyNode<T> preNode;
T data;
if (head != null)
{
MyNode<T> temp = head;
while (true)
{
if (temp.Next != null)
{
if (temp.Next.Next == null)
{
data = temp.Next.Data;
preNode = temp;
preNode.Next = null;
count--;
return data;
}
temp = temp.Next;
}
else
{
data = temp.Data;
head = null;
count--;
return data;
}
}
}
else
{
Console.WriteLine("已经没有了");
return default(T);
}

}

public void Push(T item)
{
MyNode<T> newNode=new MyNode<T>(item);
if (head == null)
{
head = newNode;
}
else
{
MyNode<T> temp= head;
while (true)
{
if (temp.Next != null)
{
temp = temp.Next;
}
else
{
temp.Next = newNode;
break;
}
}
}
count++;
}
}