Shulou(Shulou.com)06/02 Report--

This article shares with you the content of the example analysis of linked list + priority in c #. The editor thinks it is very practical, so share it with you as a reference and follow the editor to have a look.

= = Document.cs

Using System;using System.Collections.Generic;using System.Linq;using System.Text;using System.Threading.Tasks;namespace ConsoleApplication4 {public class Document// document class {public string Title {get; private set;} / title public string Content {get; private set;} / / content public byte Priority {get; private set } / / priority public Document (string title, string content, byte priority) {this.Title = title; this.Content = content; this.Priority = priority;} public override string ToString () {return string.Format ("title: {0}, content: {1}, priority: {2}", this.Title, this.Content, this.Priority) }}}

= = PriorityDocumentManage.cs [core]

Using System;using System.Collections.Generic;using System.Linq;using System.Text;using System.Threading.Tasks;using System.Collections;namespace ConsoleApplication4 {public class PriorityDocumentManage:IEnumerable {/ / linked list private readonly LinkedList documentList; / / priority node private readonly List priorityNodes; public PriorityDocumentManage () {/ / initialize the linked list documentList = new LinkedList () / / initialize the priority node priorityNodes = new List (); / / set the priority to 0 to 9 for (int I = 0; I)

< 10; i++) { priorityNodes.Add(new LinkedListNode(null)); } } //向链表中添加文档 public void AddDocument(Document d) { if (d == null) throw new ArgumentNullException("对象不能为空"); AddDcoumentToPriorityNode(d, d.Priority); } private void AddDcoumentToPriorityNode(Document doc, int priority) { if (priority >

9 | | priority

< 0) throw new ArgumentException("优先级溢出"); if (priorityNodes[priority].Value == null)//该优先级节点的值为空，说明链表中还没有存在该优先级的元素 { --priority; if (priority >

= 0) / / continue to look below the lower priority for {AddDcoumentToPriorityNode (doc, priority);} else// to enter this method, indicating that it is the first element {documentList.AddLast (doc) to insert the linked list / / insert the element into the last position of the linked list priorityNodes [doc.Priority] = documentList.Last;// assign the passed element to the priority node of the corresponding priority}} else {LinkedListNode currentDoc = priorityNodes [priority] If (doc.Priority = = priority) / / priority node memory corresponding to the priority already exists element [priority node only stores the last element added to the corresponding priority] {documentList.AddAfter (currentDoc, doc); / / inserts the element into the back of the corresponding element priorityNodes [doc.Priority] = currentDoc.Next / / assign the corresponding priority node to the corresponding priority last added element} else// indicates that it is not the priority node corresponding to the incoming element {while (currentDoc.Previous! = null & & currentDoc.Previous.Value.Priority = = priority) / / find the highest priority The previous element {currentDoc = currentDoc.Previous } documentList.AddBefore (currentDoc, doc); / / insert the front priorityNodes [doc.Priority] = currentDoc.Previous of the element / / assign the corresponding priority node to the last added element} public IEnumerator GetEnumerator () {return documentList.GetEnumerator ();} / / find the first element and delete the element public Document GetDocument () {Document d = documentList.First.Value DocumentList.RemoveFirst (); return d;}

= = main program

Using System;using System.Collections.Generic;using System.Linq;using System.Text;using System.Threading.Tasks;namespace ConsoleApplication4 {class Program {static void Main (string [] args) {PriorityDocumentManage pdm = new PriorityDocumentManage (); pdm.AddDocument (new Document ("a", "a", 5)); pdm.AddDocument (new Document ("b", "b", 5)) Pdm.AddDocument (new Document ("c", "c", 8)); pdm.AddDocument (new Document ("d", "d", 5)); pdm.AddDocument (new Document ("e", "e", 6)); foreach (var item in pdm) {Console.WriteLine (item);} Console.ReadKey () }}}

Thank you for reading! This is the end of this article on "example analysis of linked list + priority in c #". I hope the above content can be of some help to you, so that you can learn more knowledge. if you think the article is good, you can share it for more people to see!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.