国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 編程 > C# > 正文

C#實(shí)現(xiàn)的簡單鏈表類實(shí)例

2020-01-24 01:32:14
字體:
供稿:網(wǎng)友

本文實(shí)例講述了C#實(shí)現(xiàn)的簡單鏈表類。分享給大家供大家參考。具體如下:

一、關(guān)于C#鏈表

C#鏈表可用類LinkedList來存放。本文中的類MyLinkedList只是實(shí)現(xiàn)了該類的最基本的功能。C#中沒有指針,但因?yàn)镃#中類在賦值時傳遞的是地址,因此仍然可以利用這點(diǎn)制作一個鏈表。

二、結(jié)點(diǎn)類Node和鏈表類MyLinkedList代碼

/// <summary>/// 鏈表結(jié)點(diǎn)/// </summary>class Node{  //結(jié)點(diǎn)數(shù)據(jù),前后結(jié)點(diǎn)  public object Data;  public Node PreviousNode;  public Node NextNode;  //構(gòu)造函數(shù)  public Node(object data = null)  {    Data = data;    PreviousNode = null;    NextNode = null;  }  //輸出結(jié)點(diǎn)信息  public override string ToString()  {    return Data.ToString();  }}/// <summary>/// 鏈表類/// </summary>class MyLinkedList{  //首結(jié)點(diǎn)、尾結(jié)點(diǎn)  public Node First;  public Node Last;  //下一個結(jié)點(diǎn)、上一個結(jié)點(diǎn)  public Node NextNode(Node n) { return n.NextNode; }  public Node PreviousNode(Node n) { return n.PreviousNode; }  //結(jié)點(diǎn)總數(shù)  public int Count;  //構(gòu)造函數(shù)  public MyLinkedList()  {    this.First = null;    this.Last = null;    Count = 0;  }  /// <summary>  /// 在結(jié)點(diǎn)node1之后增加結(jié)點(diǎn)node2,如果沒有該結(jié)點(diǎn)則在最后增加  /// </summary>  /// <param name="node1">結(jié)點(diǎn)1</param>  /// <param name="node2">結(jié)點(diǎn)2</param>  public void AddAfter(Node node1, Node node2)  {    //鏈表為空的情況    if (First == null)    {      Console.WriteLine("Linked-list is null! Can not find node1(" + node1 + ")");      return;    }    Node temp = First;    do    {      if (temp.Data.Equals(node1.Data))      {        //如果node1是尾結(jié)點(diǎn)        if (node1.NextNode == null)        {          node2.NextNode = null;          node2.PreviousNode = node1;          node1.NextNode = node2;        }        else //如果node1不是尾結(jié)點(diǎn)        {          node2.NextNode = node1.NextNode;          node2.PreviousNode = node1;          node2.NextNode.PreviousNode = node2;          node1.NextNode = node2; ;        }        Count++;        Console.WriteLine("Node(" + node2 + "): Add Complete!");        return;      }      temp = temp.NextNode;    }    while (temp != null);    Console.WriteLine("Can not find node(" + node1 + "), Misson defeat");  }  /// <summary>  /// 在鏈表尾部增加結(jié)點(diǎn)  /// </summary>  public void AddLast(Node node)  {    //鏈表為空的情況    if (this.First == null)     {      node.NextNode = null;      node.PreviousNode = null;      this.First = node;      this.Last = node;    }    else //鏈表不為空的情況    {      Node temp = First;      while(temp.NextNode != null)      {        temp = temp.NextNode;      }      temp.NextNode = node;      node.PreviousNode = temp;      Last = node;    }    Count++;    Console.WriteLine("Node(" + node + "): Add Complete!");  }  /// <summary>  /// 刪除指定結(jié)點(diǎn)  /// </summary>  /// <param name="node">被刪除結(jié)點(diǎn)</param>  public void Delete(Node node)  {    if (Count == 0)    {      Console.WriteLine("Can not find node(" + node + ")");      return;    }    Node temp = First;    do    {      //如果數(shù)據(jù)部分匹配,則刪去該結(jié)點(diǎn)      if (temp.Data.Equals(node.Data))      {        //temp是尾結(jié)點(diǎn)        if (temp.NextNode == null)        {          temp.PreviousNode.NextNode = null;          temp = null;        }        else //temp不是尾結(jié)點(diǎn)         {          temp.PreviousNode.NextNode = temp.NextNode;          temp.NextNode.PreviousNode = temp.PreviousNode;          temp = null;        }        Count--;        Console.WriteLine("Node(" + node + "): Delete Complete!");        return;      }      temp = temp.NextNode;    }    while (temp != null);    Console.WriteLine("Can not find node(" + node + "), Misson defeat");  }  /// <summary>  /// 修改結(jié)點(diǎn)值  /// </summary>  /// <param name="node">被修改結(jié)點(diǎn)</param>  /// <param name="value">結(jié)點(diǎn)值</param>  public void Modify(Node node, object value)  {    if (Count == 0)    {      Console.WriteLine("Can not find node(" + node + ")");      return;    }    Node temp = First;    do    {      if (temp.Data.Equals(node.Data))      {        Console.WriteLine("Node: " + temp.Data + " → " + value.ToString());        temp.Data = value;        return;      }      temp = temp.NextNode;    }    while (temp != null);  }  /// <summary>  /// 打印鏈表  /// </summary>  public void Print()  {    if (First == null)    {      Console.WriteLine("No nodes in this linked-list.");      return;    }    else    {      Console.WriteLine("Print the linked-list...");      Node temp = First;      do      {        Console.WriteLine(temp.ToString());        temp = temp.NextNode;      }      while (temp != null);      Console.WriteLine("Mission Complete!");    }  }}

三、Main函數(shù)的調(diào)用示例

static void Main(string[] args){  MyLinkedList ll = new MyLinkedList();  //添加三個結(jié)點(diǎn) 1 2(在1后) 3(在2后)  Node n1 = new Node("node1");        Node n2 = new Node("node2");  Node n3 = new Node("node3");  ll.AddLast(n1);  ll.AddLast(n2);  ll.AddLast(n3);  //添加三個結(jié)點(diǎn) 1.5(在1后) 2.5(在2后) 3.5(在3后)  Node n1dot5 = new Node("node1dot5");  Node n2dot5 = new Node("node2dot5");  Node n3dot5 = new Node("node3dot5");  ll.AddAfter(n1, n1dot5);  ll.AddAfter(n2, n2dot5);  ll.AddAfter(n3, n3dot5);  Console.WriteLine("========================");  //打印鏈表  ll.Print();  Console.WriteLine("========================");  //刪除結(jié)點(diǎn) 2 和 3,將結(jié)點(diǎn) 2.5 的值改為 "ThisNodeIsModified!"  ll.Delete(n2);  ll.Delete(n3);  ll.Modify(n2dot5, "ThisNodeIsModified!");  Console.WriteLine("========================");  //打印鏈表  ll.Print();  Console.ReadLine();}

四、運(yùn)行結(jié)果

希望本文所述對大家的C#程序設(shè)計有所幫助。

發(fā)表評論 共有條評論
用戶名: 密碼:
驗(yàn)證碼: 匿名發(fā)表
主站蜘蛛池模板: 仁寿县| 拜城县| 河北省| 内江市| 牡丹江市| 漠河县| 丰县| 西平县| 积石山| 南漳县| 称多县| 本溪市| 上栗县| 梅州市| 勐海县| 岫岩| 舟曲县| 唐海县| 班玛县| 冷水江市| 民权县| 襄汾县| 麻江县| 乐安县| 化州市| 双江| 滨海县| 上高县| 泌阳县| 鹿邑县| 濮阳市| 衡南县| 游戏| 邢台县| 云阳县| 镇巴县| 蒙山县| 得荣县| 呼图壁县| 吴忠市| 民丰县|