µ¥Á´±íÎÊÌâ c¸ßÊÖÇë½ø
±àдһ¸ö³ÌÐòÓÃÁ´±íʵÏÖ£º½«Ò»¸öÉýÐòÕûÊýÊýÁеÄÖØ¸´Êý¾ÝÈ¥µô
±àºÃºó£¬½á¹û²»¶Ô°¡£¬ÇóÖúc¸ßÊÖ
#include <stdio.h>
#include <stdlib.h>
struct link
{
int number;
struct link *next;
};
struct link* creat()
{
struct link *p1,*p2;
struct link *head;
int n=0;
p1=p2=(struct link*)malloc(sizeof(struct link));
scanf("%d",&p2->number);
head=NULL;
while(p2->number!=0)
{
n++;
if(n==1)
head=p1;
else
{
p1->next=p2;
p1=p2;
}
p2=(struct link *)malloc(sizeof(struct link));
scanf("%d",&p2->number);
}
p1->next=NULL;
return head;
}
/struct link *del(struct link *head)
{
struct link *p1,*p2;
if(head==NULL)
printf("link is empty!");
p1=p2=head;
if(p1->next==NULL)
printf("needn't sort!");
else
{
while(p1->next!=NULL)
{
p1->next=p2;
if(p1->number==p2->number)
{
&nb
Ïà¹ØÎÊ´ð£º
#include <string.h>
#include <stdio.h>
void main()
{
int i;
char buf[]="abcde";
strncpy(buf,"abc",3);
for(i=0;i <5;i++)
printf(&q ......
ÔÚueÖдÓÔ¶³ÌunixÓöþ½øÖÆ·½Ê½ÏÂÔØcÎļþµ½±¾µØ£¬ÐÞ¸ÄÖ®ºóÓöþ½øÖÆ·½Ê½ÉÏ´«µ½unixÖУ¬ÔÙÓÃvi´ò¿ª¸ÃÎļþ£¬Ã¿ÐкóÃæ¾Í»áÓÐÒ»¸ö^MµÄ»»Ðзû£¬Èç¹û²ÉÓÃascii·½Ê½ÏÂÔØ£¬¶þ½øÖÆ·½Ê½ÉÏ´«µÄ»°¾ÍûÓÐ^M£¬ÄÇÇëÎÊÕâÑù»á¶Ô³ÌÐòÎļþ ......
ÔËÐл·¾³ÊÇunix£¬ÎÒÓÃueÒÔftp·½Ê½Á¬µ½unixÉÏ£¬È»ºóÔÚueÖбàдc³ÌÐò£¬µ«ÔÚunixÏÂÓÃvi¿´³ÌÐòʱ£¬Ã¿ÐкóÃæ¶¼¶àÁËÒ»¸ö^M£¬Õâ¸öÓ¦¸ÃÊÇunixµÄ»»Ðзû£¬Ã¿´ÎÖ»ÄÜɾ³ýÒ»±éÈ»ºó²ÅÄܱàÒ룬·ñÔò»á±¨´í£¬ÇëÎÊÕâÊÇÔÚueÖÐ×Ö·û±àÂëµÄ ......
C/C++ 2009-9ר¼Ò°ñ
Ãû´Î ר¼ÒÃû³Æ ר¼Ò·Ö ¸öÈËÃèÊö
1 mstlq £¨ÃæÉ«Ìú·ÇÅ£© 5843 ÒòΪ²Ë£¬ËùÒÔŬÁ¦Ñ§Ï°ÖÐ
2 whg01 £¨¼°Ê±½áÌùÊÇÃÀµÂ£©&n ......
±ÈÈçÊý×éarray[100]="12@good@thanks@men@";
Ôõô×ö²ÅÄܽ«array1[100]="12";array2[100]="good";array3[100]="thanks";array4="men";
ÐèÒªÔõô×öÄØ?CÀ ......