ÇóÒ»¸öÁ´±í³ÌÐò c¸ßÊÖÇë½ø
µ¥Á´±íÖи÷½áµã´æ·ÅÒ»¸öÊý£¬Çë°´ÉýÐòÅÅÁÐ
лл ¸÷λ´óϺ
±¾È˳õѧÊý¾Ý½á¹¹ Ï£Íû´óϺ°ïһϠÈëÃÅ
Õâ¸öºÜ¼òµ¥µÄ°¡,Äã¿ÉÒÔ½¨Á¢Ò»¸ö¸¨ÖúÁ´±í,ÿ´ÎÕÒÁ´±íÖÐ×îСµÄÊýµÄ½Úµã²åÈëµ½ÐÂÁ´±íÖÐ,×Ô¼º³¢ÊÔдÏÂ,²»ÄѵÄ
±éÀú¹ýÈ¥£¬Ã°ÅݾͿÉÒÔ¡£
ðÅݰ¢
³õѧ¶¼µÃ»áµÄ
C/C++ code:
#include<stdio.h>
typedef struct node{
char data;
struct node *next;
}Link;
void
display(Link *h)
{
Link *t;
t=h->next;
while(t!=NULL)
{
printf("%d->",t->data);
t=t->next;
}
}
Link *
creat_link()
{
int run=1,v,i=1;
Link *h,*t,*s;
h=(Link *)malloc(sizeof(Link));
if(NULL==h)
exit(1);
t=h;
while(run)
{
printf("please input the %drd node vlaue:",i++);
scanf("%d",&v);
if(v!=-1) //ÊäÈë-1±íʾÁ´±í½áÊø
{
s=(Link*)malloc(sizeof(Link));
if(NULL==s)
exit(1);
s->data=v;
t->next=s;
t=s;
}
else
run=0;
}
t->next=NULL;
printf("before sort,the link is :");
display(h);
return h;
}
void
sort(Link *h)
{
Link *r,*p,*q;
if(h!=NULL)
{
p=h->next;
r=p->next;
p-
Ïà¹ØÎÊ´ð£º
#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 ......
QQȺ 29152388
ÓÑÇéUP
°ï¶¥
up
°ïup
up Ö§³Ö£¡
up jf
...ÄѵÀÓзÖ..?
up up up
Ï£ÍûÓеüӷ֣¬¹þ¹þ¡£
Ö§³Ö£¬ÎÒ¼ÓÁË£¬Ï£ÍûÂ¥Ö÷ÄܼÓÎÒ£¬¹²Í¬Ñ§Ï°¹þ
¼ÓÁË¡£
¶¥ÉÏ£¬Ã¿ÌìÊÕ»ñÒ»µã£¬Ö§³Ö ......
´ó¼Ò°ïÎÒ¿´¿´Õâ¸ö´úÂ룬ÓкܶàÎÊÌ⣬²»ÖªµÀÔõô¸Ä£¬Ð¡µÜÔÚ´ËллÁË¡£
#include <stdio.h>
#include <conio.h>
#include <ctype.h>
float date1,date2;
char op;
void ......
const int num=100
float neiji(float [num]b, float [num]c)
{
int p;
float nj ......
ÏÂÃæÊÇÎҵĴúÂë ´ÓÄÚ´æÐ´ÈëÎļþÕýÈ· µ«´ÓÎļþ¶ÁÈëÄÚ´æ¶¼ÊÇÂÒÂë ¶øÇÒ³ÌÐò±ÀÀ£ Çëc¸ßÊÖÖ¸µã
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct inf
{
& ......