Last active
July 12, 2022 02:40
-
-
Save zoeisnowooze/d9b853a1aa013b0c8488eca4a4f25b90 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <stdlib.h> | |
#include <time.h> | |
typedef struct node { | |
int val; | |
struct node *next; | |
struct node *random; | |
} node; | |
node *create_list(int n) { | |
node **nodes = malloc(n * sizeof(node *)); | |
for (int i = 0; i < n; i++) { | |
nodes[i] = malloc(sizeof(node)); | |
nodes[i]->val = rand(); | |
nodes[i]->next = NULL; | |
nodes[i]->random = NULL; | |
} | |
for (int i = 0; i < n; i++) { | |
if (i != n - 1) { | |
nodes[i]->next = nodes[i + 1]; | |
} | |
if (rand() % n != 0) { | |
nodes[i]->random = nodes[rand() % n]; | |
} | |
} | |
node *head = nodes[0]; | |
free(nodes); | |
return head; | |
} | |
int list_len(node *list) { | |
int len = 0; | |
while (list) { | |
len++; | |
list = list->next; | |
} | |
return len; | |
} | |
node *copy_list(node *list) { | |
node *n = list; | |
node *prev = NULL; | |
node *copy = NULL; | |
int len = list_len(list); | |
node **map = malloc(2 * sizeof(node *) * len); | |
for (int i = 0; i < len; i++, n = n->next) { | |
node *next = malloc(sizeof(node)); | |
next->val = n->val; | |
next->next = NULL; | |
next->random = n->random; | |
if (prev) { | |
prev->next = next; | |
} else { | |
copy = next; | |
} | |
map[i * 2] = n; | |
map[i * 2 + 1] = next; | |
prev = next; | |
} | |
n = copy; | |
while (n) { | |
if (n->random) { | |
for (int i = 0; i < len; i++) { | |
if (map[i * 2] == n->random) { | |
n->random = map[i * 2 + 1]; | |
break; | |
} | |
} | |
} | |
n = n->next; | |
} | |
free(map); | |
return copy; | |
} | |
void print_list(char *label, node *list) { | |
printf("%s\n", label); | |
while (list) { | |
if (list->random) { | |
printf("%d -> %d\n", list->val, list->random->val); | |
} else { | |
printf("%d\n", list->val); | |
} | |
list = list->next; | |
} | |
} | |
void free_list(node *list) { | |
while (list) { | |
node *next = list->next; | |
free(list); | |
list = next; | |
} | |
} | |
int main(int argc, char **argv) { | |
srand(time(NULL)); | |
node *head = create_list(10); | |
print_list("Original", head); | |
node *copy = copy_list(head); | |
free_list(head); | |
print_list("Copy", copy); | |
free_list(copy); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment