1、 p=link-next; while (p-next!=link) / if (p-key=key) / key, p-prev-next=p-next-prev=p-prev; free(p); return link; else p=p- / if (p-next = link) return NULL; /NULL 2 * * * * * * * * * * * * * * *void printTriangle(const unsigned char line);void printTriangle(const unsigned char line) for(int i=1;i=li
2、ne;i+) for(int j=0;j=(line-1-i/2*2) & j=(line-2-(i/2-1)*2) &=(line+(i/2-1)*2) printf( printf(n3Cchar *strstr(char *str1,char *str2);str1str2char * strstr ( const char * str1, const char * str2 ) char *cp = (char *) str1; char *s1, *s2; if ( !*str2 ) return(char *)str1); while (*cp) s1 = cp;
3、 s2 = (char *) str2; while ( *s1 & *s2 & !(*s1-*s2) ) s1+, s2+; if (!*s2) return(cp); cp+; return(NULL);4main()char i=0; while(i10) if(i1)continue; if(i=5)break; i+; .5#define1 #define MIN (365*24*60*60)6mainint x=10,y=3;printf(%dn,y=x/y);𣺽37#define P 3void F(int x)return(P*x*x);,F(3+5);𣺳129F(8)𰸣3*3+5*3+5;8int2char1float4struct stuunion char bj5; int bh2;class;char xm8;float cj;xc;sizeof(xc)?209tracerouteTTLTime To Live1ICMPTTL10ICMP time exceededTTLtraceroute traceroute TTL2 2 .datagram