addLast
Lesson 6 of 14 in Coddy's Linked List - Data Structures Series #5 course.
Challenge
EasyAdd a method addLast to the LinkedList class.
It gets an integer value and inserts a new node carrying that value at the end of the list. Increment count.
Try it yourself
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "linkedlist.h"
int main() {
LinkedList ll;
LinkedList_init(&ll);
char line[256];
while (fgets(line, sizeof(line), stdin)) {
line[strcspn(line, "\r\n")] = '\0';
char* cmd = strtok(line, " \t");
if (!cmd) continue;
if (strcmp(cmd, "state") == 0) printf("%s %d\n", ll.head == NULL ? "true" : "false", ll.count);
if (strcmp(cmd, "count") == 0) printf("%d\n", ll.count);
if (strcmp(cmd, "headValue") == 0) printf("%d\n", Node_getValue(ll.head));
if (strcmp(cmd, "addFirst") == 0) {
char* arg = strtok(NULL, " \t");
LinkedList_addFirst(&ll, atoi(arg));
}
if (strcmp(cmd, "addLast") == 0) {
char* arg = strtok(NULL, " \t");
LinkedList_addLast(&ll, atoi(arg));
}
}
return 0;
}
