/C/Divide a linked list into three parts based on their position mod 3.

Divide a linked list into three parts based on their position mod 3.

int split_list(struct node *ll)
{
    struct node *l1, *l2, *l3;
    if(!(ll && ll->next && ll->next->next)){
        printf("Need atleast 3 elements\n");
        return -1;
    }
    l1 = ll;
    l2 = ll->next;
    l3 = ll->next->next;
    while(l3 && l3->next && l3->next->next){
        l1 = l1->next;
        l2 = l2->next->next;
        l3 = l3->next->next->next;
    }
    l3 = l2->next;
    l2->next = NULL;
    l2 = l1->next;  
    l1->next = NULL;
    l1 = ll;
    printf("l1:%d, l2=%d, l3=%d\n", l1->data, l2->data, l3->data);

    return 0;
}

Source: stackoverflow.com

Similar codes

1 vote246 views1 answer
Adb switch to usb
C
0 vote259 views1 answer
Print 0 1 2 3 4 in c while loop
C
0 vote263 views1 answer
Semicolong after for() loop stackoverflow
C
0 vote258 views1 answer
C command line arguments parser
C
0 vote267 views1 answer
Gcc options to find out makefiel rules
C
0 vote265 views2 answers
C read file from command line
C
0 vote292 views1 answer
How to remove "Web site created using create-react-app."
C
0 vote232 views1 answer
C ausgabe von variablen
C
0 vote308 views1 answer
How to login to another user in powershell
C
0 vote229 views1 answer
A binary tree whose every node has either zero or two children is called
C