}
link_t* list_insert(link_t* head, unsigned index, int value) {
+ unsigned max_index = list_count(head);
if (index == 0) {
return list_prepend(head, value);
- } else if (index == list_count(head)) {
+ } else if (index == max_index) {
return list_append(head, value);
} else {
link_t* link_insrt = list_new(value);
link_t* head_prev = NULL;
link_t* head_next = NULL;
link_t* head_ret = NULL;
-
+
if (head == NULL) {
return NULL;
} else if (index == 0) {
printf("------Begin------\n");
while (head != NULL) {
printf("value at [%d]=%d\n", i, head->value);
- head = head->next;
- i++;
+ head = head->next;
+ i++;
}
printf("------End------\n");
}
#include "clist.h"
link_t* list_new(int value) {
- link_t* link_new;
+ link_t* link_new;
link_new = malloc(sizeof(link_t));
link_new->value = value;
link_new->next = NULL;
link_t* list_append(link_t* head, int value) {
- if (head == NULL) {
+ if (head == NULL) {
return head = list_new(value);
} else {
link_t* head_first = head;
while (head->next != NULL) {
- head = head->next;
+ head = head->next;
}
head->next = list_new(value);
return head_first;
link_t* list_prepend(link_t* head, int value) {
link_t* first_link = list_new(value);
-
+
first_link->next = head;
return first_link;
}
link_t* list_insert(link_t* head, unsigned index, int value) {
if (index == 0) {
- return list_prepend(head, value);
+ return list_prepend(head, value);
} else if (index == list_count(head)) {
return list_append(head, value);
} else {
- link_t* link_insrt = list_new(value);
+ link_t* link_insrt = list_new(value);
link_t* head_first = head;
link_t* head_next = NULL;
for (unsigned i = 0; i < index-1; i++) {
head_next = head->next;
head->next = link_insrt;
head = link_insrt;
- head->next = head_next;
+ head->next = head_next;
return head_first;
}
}
link_t* head_prev = NULL;
link_t* head_next = NULL;
link_t* head_ret = NULL;
-
+
if (head == NULL) {
return NULL;
} else if (index == 0) {
tmp = head->value;
head->value = head->next->value;
head->next->value = tmp;
- isswaped = true;
+ isswaped = true;
}
- head = head->next;
+ head = head->next;
}
- /* Reloop at the beginning of the list until there's values swaped */
- head = head_first;
+ /* Reloop at the beginning of the list until there's values swaped */
+ head = head_first;
} while (isswaped);
return head_first;
}
}
if (head1->value < head2->value) {
head_result = head1;
- head_result->next = _list_merge_sort(head1->next, head2);
+ head_result->next = _list_merge_sort(head1->next, head2);
} else {
head_result = head2;
- head_result->next = _list_merge_sort(head1, head2->next);
+ head_result->next = _list_merge_sort(head1, head2->next);
}
return head_result;
}
unsigned list_count(link_t* head) {
unsigned count = 0;
-
+
while (head != NULL) {
++count;
head = head->next;
- }
+ }
return count;
}
}
int list_get(link_t* head, unsigned index) {
- unsigned count = 0;
+ unsigned count = 0;
while (head != NULL && count < index) {
++count;
- head = head->next;
+ head = head->next;
}
- if (head != NULL) {
+ if (head != NULL) {
return head->value;
} else {
return -1;
printf("------Begin------\n");
while (head != NULL) {
printf("value at [%d]=%d\n", i, head->value);
- head = head->next;
- i++;
+ head = head->next;
+ i++;
}
printf("------End------\n");
}