LinkedList
一、本质
LinkedList 是一个 C#为我们封装好的类 它的本质是一个可变类型的泛型双向链表#endregion
二、申明
1 2 3 4 5 6
| using system.Collections.Generic LinkedList<int> linkedList = new LinkedList<int>(); LinkedList<string> linkedList2 = new LinkedList<string>();
|
三、增删查改
1.增
1 2 3 4 5 6 7 8 9 10 11 12 13
| linkedList.AddLast(10);
linkedList.AddFirst(20);
LinkedListNode<int> n = linkedList.Find(20); linkedList.AddAfter(n, 15);
LinkedListNode<int> n = linkedList.Find(20); linkedList.AddBefore(n, 15);
|
2.删
1 2 3 4 5 6 7 8 9
| linkedList.RemoveFirst();
linkedList.RemoveLast();
linkedList.Remove(20);
linkedList.clear();
|
3.查
1 2 3 4 5 6 7 8 9 10 11 12 13
| LinkedListNode<int> first = linkedList.First;
LinkedListNode<int> last = linkedList.Last;
LinkedListNode<int> node = linkedList.Find(3); Console.WriteLine(node.Value); node = linkedList.Find(5);
if(linkedList.contains(1)) Console.WriteLine("链表中存在1");
|
4.改
1 2 3 4
| Console.WriteLine(linkedList.First.Value); linkedList.First.Value = 10; Console.WriteLine(linkedList.First.Value)
|
5.遍历
1 2 3 4 5 6 7 8 9 10 11 12 13
|
foreach(int item in linkedList) Console.WriteLine(item);
LinkedListNode<int> nowNode = linkedList.First; while(nowNode != null) { Console.WriteLine(nowNode.Value); nowNode = nowNode.Next; }
|