Delete the head node of 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
Example output:
2->3->4

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);

            LinkedListNode<int> node = list.First;
            list.RemoveFirst();
            Console.WriteLine(node.Value);
            Console.ReadLine();
        }
    }
}