C#如何自定義線(xiàn)性節(jié)點(diǎn)鏈表集合
本例子實(shí)現(xiàn)了如何自定義線(xiàn)性節(jié)點(diǎn)集合,具體代碼如下:
using System; using System.Collections; using System.Collections.Generic; namespace LineNodeDemo { class Program { static void Main(string[] args) { LineNodeCollection lineNodes = new LineNodeCollection(); lineNodes.Add(new LineNode("N1") { Name = "Microsoft" }); lineNodes.Add(new LineNode("N2") { Name = "Lenovo" }); lineNodes.Add(new LineNode("N3") { Name = "Apple" }); lineNodes.Add(new LineNode("N4") { Name = "China Mobile" }); Console.WriteLine("1、顯示全部:"); lineNodes.ForEach(x => { Console.WriteLine(x.Name); }); Console.WriteLine("2、刪除編號(hào)為N2的元素:"); lineNodes.Remove("N2"); lineNodes.ForEach(x => { Console.WriteLine(x.Name); }); Console.WriteLine("3、刪除索引為1的元素:"); lineNodes.RemoveAt(1); lineNodes.ForEach(x => { Console.WriteLine(x.Name); }); Console.WriteLine("4、顯示索引為0元素的名稱(chēng):"); Console.WriteLine(lineNodes[0].Name); Console.WriteLine("5、顯示編號(hào)為N4元素的名稱(chēng):"); Console.WriteLine(lineNodes["N4"].Name); Console.WriteLine("6、清空"); lineNodes.Clear(); lineNodes.ForEach(x => { Console.WriteLine(x.Name); }); Console.ReadKey(); } } static class Utility { public static void ForEach<T>(this IEnumerable<T> source, Action<T> action) { foreach(var r in source) { action(r); } } } class LineNodeCollection : IEnumerable<LineNode> { public IEnumerator<LineNode> GetEnumerator() { return new LineNodeEnumerator(this.firstLineNode); } IEnumerator IEnumerable.GetEnumerator() { return this.GetEnumerator(); } public LineNode this[int index] { get { LineNode _lineNode= this.firstLineNode; for (int i=0;i<=index;i++) { if (_lineNode != null) { if(i<index) { _lineNode = _lineNode.Next; continue; } else { return _lineNode; } } else break; } throw new IndexOutOfRangeException("超出集合索引范圍"); } } public LineNode this[string id] { get { LineNode _lineNode = this.firstLineNode; for (int i = 0; i < this.Count; i++) { if(_lineNode.ID == id) { return _lineNode; } else { _lineNode = _lineNode.Next; } } throw new IndexOutOfRangeException("未能在集合中找到該元素"); } } LineNode firstLineNode; LineNode lastLineNode; public void Add(LineNode lineNode) { this.Count++; if(this.firstLineNode == null) { this.firstLineNode = lineNode; } else { if (this.firstLineNode.Next == null) { lineNode.Previous = this.firstLineNode; this.firstLineNode.Next = lineNode; this.lastLineNode = this.firstLineNode.Next; } else { lineNode.Previous = this.lastLineNode; this.lastLineNode.Next = lineNode; this.lastLineNode = this.lastLineNode.Next; } } } public int Count { private set;get; } public int IndexOf(string id) { LineNode _lineNode = this.firstLineNode; for (int i = 0; i < this.Count; i++) { if (_lineNode.ID == id) { return i; } else { _lineNode = _lineNode.Next; } } throw new IndexOutOfRangeException("未能在集合中找到該元素"); } public void Clear() { this.firstLineNode = null; this.lastLineNode = null; this.Count = 0; this.GetEnumerator().Reset(); } public void RemoveAt(int index) { if (this.Count < index) throw new InvalidOperationException("超出集合索引范圍"); LineNode _currentLineNode = this[index]; if (_currentLineNode.Previous == null) { _currentLineNode = _currentLineNode.Next; this.firstLineNode = _currentLineNode; } else { LineNode _lineNode = this.firstLineNode; for (int i = 0; i <= index - 1; i++) { if (i < index - 1) { _lineNode = _lineNode.Next; continue; } if (i == index - 1) { if (_currentLineNode.Next != null) { _lineNode.Next = _lineNode.Next.Next; } else { this.lastLineNode = _lineNode; _lineNode.Next = null; } break; } } } this.Count--; } public void Remove(string id) { int _index = this.IndexOf(id); this.RemoveAt(_index); } public LineNode TopLineNode { get { return this.firstLineNode; } } public LineNode LastLineNode { get { return this.lastLineNode; } } } class LineNodeEnumerator : IEnumerator<LineNode> { LineNode topLineNode; public LineNodeEnumerator(LineNode topLineNode) { this.topLineNode = topLineNode; } public LineNode Current { get { return this.lineNode; } } object IEnumerator.Current { get { return this.Current; } } public void Dispose() { this.lineNode = null; } LineNode lineNode; public bool MoveNext() { if(this.lineNode == null) { this.lineNode = this.topLineNode; if (this.lineNode == null) return false; if (this.lineNode.Next == null) return false; else return true; } else { if(this.lineNode.Next !=null) { this.lineNode = this.lineNode.Next; return true; } return false; } } public void Reset() { this.lineNode = null; } } class LineNode { public LineNode(string id) { this.ID = id; } public string ID { private set; get; } public string Name {set; get; } public LineNode Next { set; get; } public LineNode Previous { set; get; } } }
注意:
①這里所謂的線(xiàn)性節(jié)點(diǎn)指定是每個(gè)節(jié)點(diǎn)之間通過(guò)關(guān)聯(lián)前后節(jié)點(diǎn),從而形成鏈接的節(jié)點(diǎn);
②本示例完全由博主原創(chuàng),轉(zhuǎn)載請(qǐng)注明來(lái)處。
運(yùn)行結(jié)果如下:
示例下載地址:C#自定義線(xiàn)性節(jié)點(diǎn)鏈表集合
(請(qǐng)使用VS2015打開(kāi),如果為其他版本,請(qǐng)將Program.cs中的內(nèi)容復(fù)制到自己創(chuàng)建的控制臺(tái)程序中)
以上就是本文的全部?jī)?nèi)容,希望對(duì)大家的學(xué)習(xí)有所幫助,也希望大家多多支持腳本之家。
- C語(yǔ)言 數(shù)據(jù)結(jié)構(gòu)鏈表的實(shí)例(十九種操作)
- C++ 實(shí)現(xiàn)雙向鏈表的實(shí)例
- C語(yǔ)言之復(fù)雜鏈表的復(fù)制詳解
- C語(yǔ)言數(shù)據(jù)結(jié)構(gòu)之雙向循環(huán)鏈表的實(shí)例
- C++ 實(shí)現(xiàn)靜態(tài)鏈表的簡(jiǎn)單實(shí)例
- 面試題快慢鏈表和快慢指針
- C++ 中循環(huán)鏈表和約瑟夫環(huán)
- C語(yǔ)言中雙向鏈表和雙向循環(huán)鏈表詳解
- C語(yǔ)言數(shù)據(jù)結(jié)構(gòu)實(shí)現(xiàn)鏈表去重的實(shí)例
相關(guān)文章
C#實(shí)現(xiàn)會(huì)移動(dòng)的文字效果
這篇文章主要為大家詳細(xì)介紹了C#實(shí)現(xiàn)會(huì)移動(dòng)的文字效果,文中示例代碼介紹的非常詳細(xì),具有一定的參考價(jià)值,感興趣的小伙伴們可以參考一下2021-04-04C#中判斷一個(gè)集合是否是另一個(gè)集合的子集的簡(jiǎn)單方法
本文介紹利用C#中內(nèi)置的系統(tǒng)函數(shù)判斷一個(gè)集合是否是一個(gè)集合的子集的方法,此方法代碼量極少,分享給大家。2016-04-04