Install Steam
sign in
|
language
简体中文 (Simplified Chinese)
繁體中文 (Traditional Chinese)
日本語 (Japanese)
한국어 (Korean)
ไทย (Thai)
Български (Bulgarian)
Čeština (Czech)
Dansk (Danish)
Deutsch (German)
Español - España (Spanish - Spain)
Español - Latinoamérica (Spanish - Latin America)
Ελληνικά (Greek)
Français (French)
Italiano (Italian)
Bahasa Indonesia (Indonesian)
Magyar (Hungarian)
Nederlands (Dutch)
Norsk (Norwegian)
Polski (Polish)
Português (Portuguese - Portugal)
Português - Brasil (Portuguese - Brazil)
Română (Romanian)
Русский (Russian)
Suomi (Finnish)
Svenska (Swedish)
Türkçe (Turkish)
Tiếng Việt (Vietnamese)
Українська (Ukrainian)
Report a translation problem

Korea, Republic of
#include <stdlib.h>
typedef struct Data {
int value;
struct Data *next;
} Data;
Data* insert(Data* head, int value) {
Data* new_node = (Data*)malloc(sizeof(Data));
new_node->value = value;
new_node->next = head;
return new_node;
}
Data* reconnect(Data* head, int value) {
if (head == NULL || head->value == value) return head;
Data *prev = NULL, *curr = head;
while (curr != NULL && curr->value != value) {
prev = curr;
curr = curr->next;
}
if (curr != NULL && prev != NULL) {
prev->next = curr->next;
curr->next = head;
head = curr;
}
return head;
}
int main() {
Data *head = NULL, *curr;
for (int i = 1; i <= 5; i++)
head = insert(head, i);
head = reconnect(head, 3);
for (curr = head; curr != NULL; curr = curr->next)
printf("%d", curr->value);
return 0;
}
░░░░░▄█▌▀▄▓▓▄▄▄▄▀▀▀▄▓▓▓▓▓▌█
░░░▄█▀▀▄▓█▓▓▓▓▓▓▓▓▓▓▓▓▀░▓▌█
░░█▀▄▓▓▓███▓▓▓███▓▓▓▄░░▄▓▐█▌
░█▌▓▓▓▀▀▓▓▓▓███▓▓▓▓▓▓▓▄▀▓▓▐█
▐█▐██▐░▄▓▓▓▓▓▀▄░▀▓▓▓▓▓▓▓▓▓▌█▌
█▌███▓▓▓▓▓▓▓▓▐░░▄▓▓███▓▓▓▄▀▐█
█▐█▓▀░░▀▓▓▓▓▓▓▓▓▓██████▓▓▓▓▐█
▌▓▄▌▀░▀░▐▀█▄▓▓██████████▓▓▓▌█▌
▌▓▓▓▄▄▀▀▓▓▓▀▓▓▓▓▓▓▓▓█▓█▓█▓▓▌█▌
█▐▓▓▓▓▓▓▄▄▄▓▓▓▓▓▓█▓█▓█▓█▓▓▓▐█
⠀⠀⠀⢠⡣⠘⠤⠤⣀⡠⠊⠀⢸
⠀⢀⠔⠊⠀⠀⠀⠀⠀⠘⢤⡾⢸
⠀⡇⢠⡶⠀⠀⢀⢤⡀⠀⠀⠑⡄⡇
⢸⠀⣠⣄⠀⠀⠘⠛⠁⠀⠀⠀⠈⢺
⡅⢹⢾⠞⢓⡈⡀⠀⠀⠀⠀⠀⠀⠘⡄
⢣⠀⠉⠒⠤⠔⠀⠀⠀⠀⠀⠀⠀⢸
⠘⢄⠀⠀⠀⠀⠀⠀⠀⠀⢀⠐⠀⡇
⠀⠀⠑⢄⣀⣀⡠⠤⠒⠊⢀⡠⠊
⠀⠀⠀⢠⡣⠘⠤⠤⣀⡠⠊⠀⢸
⠀⢀⠔⠊⠀⠀⠀⠀⠀⠘⢤⡾⢸
⠀⡇⢠⡶⠀⠀⢀⢤⡀⠀⠀⠑⡄⡇
⢸⠀⣠⣄⠀⠀⠘⠛⠁⠀⠀⠀⠈⢺
⡅⢹⢾⠞⢓⡈⡀⠀⠀⠀⠀⠀⠀⠘⡄
⢣⠀⠉⠒⠤⠔⠀⠀⠀⠀⠀⠀⠀⢸
⠘⢄⠀⠀⠀⠀⠀⠀⠀⠀⢀⠐⠀⡇
⠀⠀⠑⢄⣀⣀⡠⠤⠒⠊⢀⡠⠊