本文整理汇总了C#中LinkedList.Insert方法的典型用法代码示例。如果您正苦于以下问题：C# LinkedList.Insert方法的具体用法？C# LinkedList.Insert怎么用？C# LinkedList.Insert使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类LinkedList的用法示例。
在下文中一共展示了LinkedList.Insert方法的15个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: Main
public static void Main()
{
try
{
LinkedList list = new LinkedList();
Console.WriteLine("It is {0} that this list in empty", list.IsEmpty());
list.Insert("Happy days");
list.Insert("Pie in the sky");
list.Insert("Trouble in River City");
Console.WriteLine("The original list is:");
list.Display();
list.Reset();
list.Advance();
Console.WriteLine("The current list element is {0}", list.GetData());
list.Remove();
Console.WriteLine("The list, after removing the current element, is:");
list.Display();
}
catch (Exception e)
{
Console.WriteLine(e);
}
Console.WriteLine("Hit any key to exit");
Console.ReadLine();
}示例2: TestCurrent
public void TestCurrent()
{
var ll = new LinkedList<int>(1);
ll.Insert(new Node<int>(2));
ll.Insert(new Node<int>(5));
ll.Insert(new Node<int>(9));
Assert.IsTrue(ll.Last.Data == 9);
}示例3: TestFindAt
public void TestFindAt()
{
var ll = new LinkedList<int>(1);
ll.Insert(new Node<int>(2));
ll.Insert(new Node<int>(5));
ll.Insert(new Node<int>(9));
var node = ll.FindAt(2);
var node2 = ll.FindAt(2-1);
Assert.IsTrue(node2.Data == 2);
Assert.IsTrue(node.Data == 5);
}示例4: EnumeratePowerSet
public static LinkedList<int[]> EnumeratePowerSet(int[] set)
{
var result = new LinkedList<int[]>();
result.Insert(new int[0]);
EnumeratePowerSet(set, 0, new int[0], result);
return result;
}示例5: RunLinkedList
private static void RunLinkedList()
{
var linkedList = new LinkedList<int>();
Console.WriteLine("Creating a new list");
Utils.PrintList(linkedList.Head);
foreach (var key in new[] {10, 17, 1, 4, 9})
{
Console.WriteLine($"Inserting {key}");
linkedList.Insert(key);
}
Utils.PrintList(linkedList.Head);
Console.WriteLine("Deleting first element");
var node = linkedList.Search(9);
linkedList.Delete(node);
Utils.PrintList(linkedList.Head);
Console.WriteLine("Deleting last element");
node = linkedList.Search(10);
linkedList.Delete(node);
Utils.PrintList(linkedList.Head);
Console.WriteLine("Deleting element in the middle");
node = linkedList.Search(1);
linkedList.Delete(node);
Utils.PrintList(linkedList.Head);
Console.WriteLine("Deleting all nodes");
while (linkedList.Head != null)
{
linkedList.Delete(linkedList.Head);
}
Utils.PrintList(linkedList.Head);
}示例6: apply
public override IList<Variable> apply(IList<Variable> input)
{
var list = new LinkedList<Variable>();
list.AddAll(input);
//list.Add(0, );
list.Insert(0, input[input.Count - 1]);
return list;
}示例7: RunListMergeSort
static void RunListMergeSort()
{
Console.WriteLine("SORT some lists");
LinkedList<int> ll = new LinkedList<int>();
Console.WriteLine("List of one");
ll = new LinkedList<int>();
ll.Insert(5);
ll.ConsoleOutput();
ll.Sort();
ll.ConsoleOutput();
Console.WriteLine("List of two");
ll = new LinkedList<int>();
ll.Insert(5); ll.Insert(25);
ll.ConsoleOutput();
ll.Sort();
ll.ConsoleOutput();
Console.WriteLine("List of two");
ll = new LinkedList<int>();
ll.Insert(255); ll.Insert(44);
ll.ConsoleOutput();
ll.Sort();
ll.ConsoleOutput();
Console.WriteLine("List of three");
ll = new LinkedList<int>();
ll.Insert(255); ll.Insert(44); ll.Insert(123);
ll.ConsoleOutput();
ll.Sort();
ll.ConsoleOutput();
Console.WriteLine("List of many");
ll = new LinkedList<int>();
ll.Insert(5); ll.Insert(25); ll.Insert(-1); ll.Insert(12345); ll.Insert(75788933); ll.Insert(9876);
ll.Insert(125); ll.Insert(3543525); ll.Insert(647); ll.Insert(854); ll.Insert(234);
ll.Insert(-255); ll.Insert(1); ll.Insert(2); ll.Insert(12346); ll.Insert(75788932);
ll.Insert(9877); ll.Insert(9875); ll.Insert(12343); ll.Insert(23); ll.Insert(0);
ll.ConsoleOutput();
ll.Sort();
ll.ConsoleOutput();
}示例8: Main
public static void Main()
{
LinkedList<int> asd = new LinkedList<int>();
asd.Add(5);
asd.Add(1);
asd.Add(7);
asd.Insert(0, 21);
asd.Insert(1, 27);
Console.WriteLine(asd.GetElement(0).Value);
Console.WriteLine(asd.GetElement(1).Value);
Console.WriteLine(asd.GetElement(2).Value);
Console.WriteLine();
Console.WriteLine(asd.FirstElement.Value);
Console.WriteLine(asd.LastElement.Value);
ListItem<int>[] elements = asd.ToArray();
}示例9: ItShouldBeAbleToInsert
public void ItShouldBeAbleToInsert()
{
LinkedList<object> list = new LinkedList<object>();
list.Add('a');
list.Add('b');
list.Add('c');
list.Add('d');
list.Add('e');
list.Insert('f',2);
object expected = 'f';
object actual = list[2];
Assert.AreEqual(expected, actual);
}示例10: TestLinkedListOperators
public void TestLinkedListOperators()
{
var lst = new LinkedList<int>();
lst.Append(1);
lst.Append(2);
lst.Append(4);
lst.Append(5);
lst.Insert(2, 3);
Assert.AreEqual(lst.Get(2).Content, 3);
Assert.AreEqual(lst.Get(3).Content, 4);
lst.Remove(0);
Assert.AreEqual(lst.Get(0).Content, 2);
Assert.AreEqual(lst.ToString(), "2 3 4 5");
}示例11: RemoveDuplicateFromUnsortedListTest
public void RemoveDuplicateFromUnsortedListTest()
{
var linkedList = new LinkedList<int>();
linkedList.Insert(1);
linkedList.Insert(2);
linkedList.Insert(8);
linkedList.Insert(2);
linkedList.Insert(3);
linkedList.Insert(1);
linkedList.Insert(4);
int[] result = LinkedListProblems.RemoveDuplicateFromUnsortedList(linkedList).ToArray();
CollectionAssert.AreEqual(new[] {4, 1, 3, 2, 8}, result);
}示例12: Enumerate
private static void Enumerate(int count, int openParensCount, string str, LinkedList<string> result)
{
if (count == 0)
{
result.Insert(str + new string(')', openParensCount));
return;
}
if (openParensCount == 0)
{
Enumerate(count - 1, openParensCount + 1, str + '(', result);
}
else
{
Enumerate(count, openParensCount - 1, str + ')', result);
Enumerate(count - 1, openParensCount + 1, str + '(', result);
}
}示例13: CycleDetectionPositiveTest
public void CycleDetectionPositiveTest()
{
var linkedList = new LinkedList<int>();
linkedList.Insert(1);
linkedList.Insert(2);
linkedList.Insert(3);
linkedList.Insert(4);
linkedList.Insert(5);
linkedList.Insert(6);
linkedList.Root.Next.Next.Next.Next.Next = linkedList.Root.Next;
bool isFound = LinkedListProblems.IsCycleFound(linkedList);
Assert.AreEqual(true, isFound);
}示例14: FindFirstParticipatingNodeInCyclePositiveTest
public void FindFirstParticipatingNodeInCyclePositiveTest()
{
var linkedList = new LinkedList<int>();
linkedList.Insert(1);
linkedList.Insert(2);
linkedList.Insert(3);
linkedList.Insert(4);
linkedList.Insert(5);
linkedList.Insert(6);
//Introduce a cycle
linkedList.Root.Next.Next.Next.Next.Next = linkedList.Root.Next;
LinkedListNode<int> result = LinkedListProblems.FindFirstParticipatingNodeInCycle(linkedList);
Assert.AreEqual(2, result.Data);
}示例15: TestInsertAt
public void TestInsertAt()
{
var ll = new LinkedList<int>(1);
ll.Insert(new Node<int>(2));
ll.Insert(new Node<int>(5));
ll.Insert(new Node<int>(9));
ll.InsertAt(new Node<int>(10), 2);
Assert.IsTrue(ll.Last.Data == 9);
Assert.IsTrue(ll.First.Next.Next.Data == 10);
Assert.IsTrue(ll.Count == 5);
}