C#中的的链式存储以简单的单向链表为例。using System; namespace lesson09 { class LinkedNodeT { public T value; public LinkedNodeT nextNode; public LinkedNode(T value) { this.value value; } } class LinkedListT { public LinkedNodeT head; public LinkedNodeT tail; public void Add(T value) { LinkedNodeT node new LinkedNodeT (value); if (head null) { head node; tail node; } else { tail.nextNode node; tail node; } } public void Remove(T value) { if (head null) { return; } if (head.value.Equals(value)) { head head.nextNode; if (head null) { tail null; } return; } LinkedNodeT node head; while (node.nextNode ! null) { if (node.nextNode.value.Equals(value)) { node.nextNode node.nextNode.nextNode; if (node.nextNode null) { tail node; } break; } node node.nextNode; } } } class Program { static void Main(string[] args) { LinkedNodeint node new LinkedNodeint(1); LinkedNodeint node2 new LinkedNodeint(2); node.nextNode node2; node.nextNode new LinkedNodeint(3); LinkedListint list new LinkedListint(); list.Add(1); list.Add(2); list.Add(3); list.Add(4); LinkedNodeint node3 list.head; while (node3 ! null) { Console.WriteLine(node3.value); node3 node3.nextNode; } node3 list.head; list.Remove(3); while (node3 ! null) { Console.WriteLine(node3.value); node3 node3.nextNode; } } } }
C#中的的链式存储以简单的单向链表为例。using System; namespace lesson09 { class LinkedNodeT { public T value; public LinkedNodeT nextNode; public LinkedNode(T value) { this.value value; } } class LinkedListT { public LinkedNodeT head; public LinkedNodeT tail; public void Add(T value) { LinkedNodeT node new LinkedNodeT (value); if (head null) { head node; tail node; } else { tail.nextNode node; tail node; } } public void Remove(T value) { if (head null) { return; } if (head.value.Equals(value)) { head head.nextNode; if (head null) { tail null; } return; } LinkedNodeT node head; while (node.nextNode ! null) { if (node.nextNode.value.Equals(value)) { node.nextNode node.nextNode.nextNode; if (node.nextNode null) { tail node; } break; } node node.nextNode; } } } class Program { static void Main(string[] args) { LinkedNodeint node new LinkedNodeint(1); LinkedNodeint node2 new LinkedNodeint(2); node.nextNode node2; node.nextNode new LinkedNodeint(3); LinkedListint list new LinkedListint(); list.Add(1); list.Add(2); list.Add(3); list.Add(4); LinkedNodeint node3 list.head; while (node3 ! null) { Console.WriteLine(node3.value); node3 node3.nextNode; } node3 list.head; list.Remove(3); while (node3 ! null) { Console.WriteLine(node3.value); node3 node3.nextNode; } } } }
