本文整理汇总了C#中DoublyLinkedList.Delete方法的典型用法代码示例。如果您正苦于以下问题：C# DoublyLinkedList.Delete方法的具体用法？C# DoublyLinkedList.Delete怎么用？C# DoublyLinkedList.Delete使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类DoublyLinkedList的用法示例。
在下文中一共展示了DoublyLinkedList.Delete方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: RunDoublyLinkedList
private static void RunDoublyLinkedList()
{
var doublyLinkedList = new DoublyLinkedList<int>();
Console.WriteLine("Creating a new list");
Utils.PrintList(doublyLinkedList.Head);
foreach (var key in new[] {10, 17, 1, 4, 9})
{
Console.WriteLine($"Inserting {key}");
doublyLinkedList.Insert(key);
}
Utils.PrintList(doublyLinkedList.Head);
Utils.PrintListReverse(doublyLinkedList.Tail);
Console.WriteLine("Appending 19");
doublyLinkedList.Append(19);
Utils.PrintList(doublyLinkedList.Head);
Utils.PrintListReverse(doublyLinkedList.Tail);
var node = doublyLinkedList.Search(17);
Console.WriteLine($"Inserting 20 before {node.Value}");
doublyLinkedList.InsertBefore(node, 20);
Utils.PrintList(doublyLinkedList.Head);
Utils.PrintListReverse(doublyLinkedList.Tail);
Console.WriteLine($"Inserting 13 after {node.Value}");
doublyLinkedList.InsertAfter(node, 13);
Utils.PrintList(doublyLinkedList.Head);
Utils.PrintListReverse(doublyLinkedList.Tail);
Console.WriteLine("Deleting first element");
node = doublyLinkedList.Search(9);
doublyLinkedList.Delete(node);
Utils.PrintList(doublyLinkedList.Head);
Utils.PrintListReverse(doublyLinkedList.Tail);
Console.WriteLine("Deleting last element");
node = doublyLinkedList.Search(10);
doublyLinkedList.Delete(node);
Utils.PrintList(doublyLinkedList.Head);
Utils.PrintListReverse(doublyLinkedList.Tail);
Console.WriteLine("Deleting element in the middle");
node = doublyLinkedList.Search(1);
doublyLinkedList.Delete(node);
Utils.PrintList(doublyLinkedList.Head);
Utils.PrintListReverse(doublyLinkedList.Tail);
Console.WriteLine("Deleting all nodes");
while (doublyLinkedList.Head != null)
{
Console.WriteLine($"Deleting {doublyLinkedList.Head.Value}");
doublyLinkedList.Delete(doublyLinkedList.Head);
}
Utils.PrintList(doublyLinkedList.Head);
Utils.PrintListReverse(doublyLinkedList.Tail);
}示例2: InsertionSort
private static void InsertionSort(DoublyLinkedList<double> bucket)
{
if (bucket.Head == null)
{
return;
}
var currentNode = bucket.Head.Next;
while (currentNode != null)
{
var node = currentNode.Previous;
while (node != null && node.Value > currentNode.Value)
{
node = node.Previous;
}
bucket.Delete(currentNode);
if (node != null)
{
bucket.InsertAfter(node, currentNode.Value);
}
else
{
bucket.Insert(currentNode.Value);
}
currentNode = currentNode.Next;
}
}示例3: should_delete_the_value_if_it_exists
public void should_delete_the_value_if_it_exists()
{
var list = new DoublyLinkedList<int>();
list.Add(5);
list.Add(2);
list.Add(3);
list.Delete(2);
Assert.That(list.Tail.Data.Equals(3), Is.True);
Assert.That(list.Head.Data.Equals(5), Is.True);
Assert.That(list.Head.Next.Data.Equals(3), Is.True);
list.Delete(5);
Assert.That(list.Tail.Data.Equals(3), Is.True);
Assert.That(list.Head.Data.Equals(3), Is.True);
list.Delete(3);
Assert.That(list.Tail, Is.Null);
Assert.That(list.Head, Is.Null);
}