ÇóÒ»¸öÁ´±í³ÌÐò 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-
Ïà¹ØÎÊ´ð£º
QQȺ 29152388
ÓÑÇéUP
°ï¶¥
up
°ïup
up Ö§³Ö£¡
up jf
...ÄѵÀÓзÖ..?
up up up
Ï£ÍûÓеüӷ֣¬¹þ¹þ¡£
Ö§³Ö£¬ÎÒ¼ÓÁË£¬Ï£ÍûÂ¥Ö÷ÄܼÓÎÒ£¬¹²Í¬Ñ§Ï°¹þ
¼ÓÁË¡£
¶¥ÉÏ£¬Ã¿ÌìÊÕ»ñÒ»µã£¬Ö§³Ö ......
¸øÒ»¸ö×Ö·û´®¡¢ÀýÈç ¡°ababc¡±ÒªÇ󷵻ء°ab¡±. ÒòΪ¡°ab¡±Á¬ÐøÖظ´³öÏÖÇÒ×¡£ ÓÃC/C£«£«ÓïÑÔдһº¯ÊýÍê³É¸ÃËã·¨£¬¸ø³ö¸´ÔÓ¶È
Õâ¸öÌâÎÒ²»»á
C/C++ code:
#include <iostream>
#include <s ......
ÔÚCÓïÑÔÖÐÈçºÎ´ò¿ªÒ»¸öÒÑÖªµÄÎļþ¡£Èç´ò¿ªÃûΪadd.txtµÄÎļþ¼ÙÉèËüÔÚC:\\Promgram Files\add.txt.ÒªÇó´ò¿ªÊ±²»¸Ä±äÆäÀïÃæµÄÄÚÈÝ¡£¸ßÊÖÇë½â´ðϰ¡
fopen( "C:\\Promgram Files\add.txt" , "rb" ......
´ó¼Ò°ïÎÒ¿´¿´Õâ¸ö´úÂ룬ÓкܶàÎÊÌ⣬²»ÖªµÀÔõô¸Ä£¬Ð¡µÜÔÚ´ËллÁË¡£
#include <stdio.h>
#include <conio.h>
#include <ctype.h>
float date1,date2;
char op;
void ......
CÅÌ9G£¬ËãÁËһϸ÷ÖÖÎļþ°üÀ¨ÒþÐÎ×ܹ²²»µ½2G£¬¿ÉÊÇϵͳÏÔʾֻʣÓà1¸ö¶àG£¬ÎÒÒѾ½«¸÷ÖÖÁÙʱÎļþ¶¼É¾³ýÁË£¬°üÀ¨´ÅÅÌÇåÀí£¬Ôõô»ØÊ£¿Ð»Ð»»Ø´ð
ʲôϵͳ£¿
ÐéÄâÄÚ´æÉèÖõ½ÆäËüÅÌ£»
¹Ø±Õϵͳ»¹Ô£»
ɾ³ýÐ ......