¿¬°á¸®½ºÆ® Áú¹® [0]

¡ã ¸Ç¹Ø ¡å
³¬½Ã¿Õ±èŰø
¾Æ¹ÙŸ/ÂÊÁö/±Û°Ë»ö

2018-06-01 22:43:22
0 0 0 96

¨Û Ãßõ  ¨á ´ÜÃàURL
¡è º¹»ç ÈÄ ºÙ¿©³ÖÀ¸¼¼¿ä.
 ±â±â¸¦ °¨ÁöÇÏ¿© ÃÖÀû URL ·Î º¸³»ÁÝ´Ï´Ù.
³¬½Ã¿Õ±èŰø
https://humoruniv.com/program6016 URL º¹»ç

typedef struct node{
char name[10];
struct node *next;
}

int delete£¨struct node *book£©;

int main£¨£©{
struct node* head = £¨node*£©malloc£¨sizeof£¨node£©£©;
head->next = NULL;

delete£¨head£©
return 0;
}

int delete£¨struct node *book£© {
char del_name[10];
struct node *curr = book->next;
struct node *curr2 = £¨ node*£©malloc£¨sizeof£¨ node£©£©;
curr2->next = curr;
printf£¨"»èÁ¦ÇÒ À̸§:"£©;
scanf£¨"%s", del_name£©;
while £¨curr != NULL£© {

if £¨strcmp£¨curr->name,del_name£© == 0£© {
curr2->next = curr->next;
printf£¨"%s", curr->name£©;
free£¨curr£©;


}
else {
curr = curr->next;
curr2->next = curr;
}


}
}

¿¬°á¸®½ºÆ® ¾È¿¡ ³»¿ëÀº regist ÇÔ¼ö·Î Á¤»óÀûÀ¸·Î ÀÔ·ÂÇØ¼­ ÀÌ»ó¾ø°í,
±×ÀÌÈÄ¿¡ ¿¬°á¸®½ºÆ® ¾È¿¡ ³»¿ëÁß ÀÔ·ÂÇÑÀ̸§ °ú °°Àº°æ¿ì »èÁ¦ÇÒ·Á°íÇϴµ¥ ¿¡·¯°¡¶ß³×¿ä
head -> node_1 -> node_2 -> NULL ÀÌ·¸°ÔµÇÀÖÀ¸¸é
head -> node_2 -> NULL ÀÌ·±½ÄÀ¸·Î ¸¸µé·ÁÇÔ

Áú¹®¿¡ ´äº¯Çϱâ

¨Û °Ô ½Ã ¹°    Ãß Ãµ ÇÏ ±â
  ·Î±×ÀÎ ¾øÀÌ Ãßõ°¡´ÉÇÕ´Ï´Ù.
ÃßõµÇ¾ú½À´Ï´Ù.
¨Û Ãßõ   ¨ä ¹Ý´ë   ¨Þ ´ä±Û   ¢Ç ¸ñ·Ï
¡ç µÚ·Î   ¡è ¸ÇÀ§   ¡é ¸Ç¹Ø   ¨· ½Å°í   ¢½ ½ºÅ©·¦
´ä±Û ÀÛ¼ºÇϱâ (·Î±×ÀÎ ÇÊ¿ä)
·Î±×ÀÎ   ¸ÞÀÎ   »çÀÌÆ®¸Ê   PCÈ­¸é