Delete the head node from a singly linked list.

Problem

Given a singly linked list, write a function to delete the head node and return the new head node.
Example input:
1 -> 2 -> 3 -> 4 -> 5
Example output:
2 -> 3 -> 4 -> 5

Solution

This solution is in C#. Our A.I. can create solutions in multiple languages.

kayakane

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {
            LinkedList<int> list = new LinkedList<int>();
            list.AddLast(1);
            list.AddLast(2);
            list.AddLast(3);
            list.AddLast(4);
            list.AddLast(5);

            Console.WriteLine("Original list:");
            foreach (var item in list)
            {
                Console.WriteLine(item);
            }

            Console.WriteLine("New list:");
            list.RemoveFirst();
            foreach (var item in list)
            {
                Console.WriteLine(item);
            }

            Console.ReadLine();
        }
    }
}