0x12. C Singly linked lists Task 0 - humtej1204/holbertonschool-low_level_programming GitHub Wiki
mandatory
Write a function that prints all the elements of a list_t list.
- Prototype:
size_t print_list(const list_t *h)
; - Return: the number of nodes
- Format: see example
- If
str
isNULL
, print[0] (nil)
- You are allowed to use
printf
julien@ubuntu:~/0x12. Singly linked lists$ cat 0-main.c
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "lists.h"
/**
* main - check the code
*
* Return: Always 0.
*/
int main(void)
{
list_t *head;
list_t *new;
list_t hello = {"World", 5, NULL};
size_t n;
head = &hello;
new = malloc(sizeof(list_t));
if (new == NULL)
{
printf("Error\n");
return (1);
}
new->str = strdup("Hello");
new->len = 5;
new->next = head;
head = new;
n = print_list(head);
printf("-> %lu elements\n", n);
printf("\n");
free(new->str);
new->str = NULL;
n = print_list(head);
printf("-> %lu elements\n", n);
free(new);
return (0);
}
julien@ubuntu:~/0x12. Singly linked lists$ gcc -Wall -pedantic -Werror -Wextra -std=gnu89 0-main.c 0-print_list.c -o a
julien@ubuntu:~/0x12. Singly linked lists$ ./a
[5] Hello
[5] World
-> 2 elements
[0] (nil)
[5] World
-> 2 elements
julien@ubuntu:~/0x12. Singly linked lists$
- GitHub repository: holbertonschool-low_level_programming
- Directory: 0x12-singly_linked_lists
- File: 0-print_list.c