假设有1 2 ....7的一串数，循环查数，查到三就删除数字，然后再从一开始查数，查到三就删除，.......。直到剩下最后一个数结束，求删除的数的顺序

#include<stdio.h>
#include<stdlib.h>

typedef struct node 
{
    int data;
    struct node *next;

}jos_t;

jos_t *create_empty_jos()
{
    jos_t *head;

    head = (jos_t *)malloc(sizeof(jos_t));
    head->data = 1;
    head->next = head;

    return head;
}

int insert_data(jos_t *head,int data)
{
    jos_t *temp;

    temp = (jos_t *)malloc(sizeof(jos_t));
    temp->data = data;

    tem