remove5.c

  name="google_ads_frame" marginwidth="0" marginheight="0" src="http://pagead2.googlesyndication.com/pagead/ads?client=ca-pub-5572165936844014&dt=1194442938015&lmt=1194190197&format=336x280_as&output=html&correlator=1194442937843&url=file%3A%2F%2F%2FC%3A%2FDocuments%2520and%2520Settings%2Flhh1%2F%E6%A1%8C%E9%9D%A2%2FCLanguage.htm&color_bg=FFFFFF&color_text=000000&color_link=000000&color_url=FFFFFF&color_border=FFFFFF&ad_type=text&ga_vid=583001034.1194442938&ga_sid=1194442938&ga_hid=1942779085&flash=9&u_h=768&u_w=1024&u_ah=740&u_aw=1024&u_cd=32&u_tz=480&u_java=true" frameborder="0" width="336" scrolling="no" height="280" allowtransparency="allowtransparency"> #include <stdio.h>
#include <alloc.h>

void main(void)
 {
   int i;

   struct ListEntry
   {
     int number;
     struct ListEntry *next;
   } start, *node, *previous;

   start.next = NULL;  // Empty list
   node = &start;      // Point to the start of the list
   for (i = 1; i <= 10; i++)
     {
       node->next = (struct ListEntry *)
     malloc(sizeof(struct ListEntry));
       node = node->next;
       node->number = i;
       node->next = NULL;
     }

    node = start.next;    // Remove the number 5
    previous = &start;
    while (node)
      if (node->number == 5)
        {
          previous->next = node->next;
          free(node);
          break;       // End the loop
        }
      else
        {
          node = node->next;
          previous = previous->next;
        }

    node = start.next;    // Display the list
    while (node)
      {
        printf("%d ", node->number);
        node = node->next;
      }
 }


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值