编写题解 1770: [编程入门]链表之报数问题 C++ 链表

解题思路:

注意事项:

参考代码:

#include<iostream>

 struct Lnode

{

    int id;

    struct Lnode *next;

};

int main()

{

    int n=10;

    std::cin>>n;

    Lnode *head=new Lnode();

    head->next=NULL;

    Lnode *p=head;

    for(int i=1;i<=n;i++)

        {

            Lnode *s=new Lnode();

            s->id=i;

            p->next=s;

            p=s;

        }

    p->next=head->next;

    p=head;

    for(int j=n-1;j>0;j--)

        {

            for(int i=1;i<3;i++)

                {           

                    p=p->next;

                }

            Lnode *q=p->next;

            p->next=q->next;

            head->next=p->next->next;

            delete q;

        }

    std::cout<<head->next->id;

    return 0;

}