c语言如何定义一个单项列表 C语言如何建立一个列表，编程怎么编，举例说一下，谢谢啦
\u7ed9\u51fa\u5efa\u7acb n\u4e2a\u7ed3\u70b9\u7684\u5355\u9879\u5217\u8868\u7684\u5b9e\u73b0\u4ee3\u7801\u7528C\u8bed\u8a00#include #include struct BiTreeNode { char data; struct BiTreeNode *rchild; struct BiTreeNode *lchild; }; void Create(struct BiTreeNode *&Tnode) //\u5148\u5e8f\u521b\u5efa2\u53c9\u94fe\u8868 { char ch; scanf("%c",&ch); if(ch=='#') { Tnode=NULL; } else { Tnode=new BiTreeNode; Tnode->data=ch; Create(Tnode->lchild); Create(Tnode->rchild); } } void PreOrder(struct BiTreeNode *&Tnode) //\u5148\u5e8f\u904d\u53862\u53c9\u94fe\u8868 { struct BiTreeNode *p; p=Tnode; if(Tnode) { printf("%c ",Tnode->data); PreOrder(Tnode->lchild); PreOrder(Tnode->rchild); } } void InOrder(struct BiTreeNode*&Tnode)//\u4e2d\u5e8f\u904d\u53862\u53c9\u8868 { struct BiTreeNode *p; p=Tnode; if(Tnode) { InOrder(Tnode->lchild); printf("%c ",Tnode->data); InOrder(Tnode->rchild); } } void PostOrder(struct BiTreeNode *&Tnode)//\u540e\u5e8f\u904d\u53862\u53c9\u94fe\u8868 { struct BiTreeNode *p; p=Tnode; if(Tnode) { PostOrder(Tnode->lchild); PostOrder(Tnode->rchild); printf("%c ",Tnode->data); } } int main() { struct BiTreeNode *Tnode; Create(Tnode); PreOrder(Tnode); printf("\n"); InOrder
\u9996\u5148\u5b9a\u4e49\u4e00\u4e2a\u94fe\u8868\u3002
struct node
{
int id;
struct node * next;
};
\u63a5\u4e0b\u6765\u5199\u4e00\u4e9b\u64cd\u4f5c\u7684\u51fd\u6570\uff08\u63d2\u5165\uff0c\u5220\u9664\u7b49\u7b49\uff09\u3002
\u63d2\u5165\u51fd\u6570\uff1a
struct node* insert(struct node* pNode, int iTemp)
{
//\u5224\u65ad pNode \u662f\u5426\u4e3a\u7a7a\u3002
if(pNode==NULL)
{
//\u8fd9\u4e2a\u8282\u70b9\u662f\u7a7a\uff0c\u8fd4\u56de\u9519\u8bef\u3002
return NULL;
}
// \u521b\u5efa\u4e00\u4e2a\u65b0\u7684\u8282\u70b9\u3002
struct node* tempNode = (struct node*)malloc(sizeof(struct node));
tempNode->id= iTemp;
if(pNode->next == NULL)
{
pNode->next = tempNode;
tempNode->next = NULL;
}else
{
struct node * pNext = pNode->next;
pNode->next = tempNode;
tempNode->next = pNext;
}
return tempNode;
}
int main()
{
struct node* head = (struct node*)malloc(sizeof(struct node));
head->id = 0;
head->next = NULL;
struct node * ptemp;
ptemp = head;
for( int i=1; i<10; i++)
{
struct node* temp = insert(ptemp,i);
ptemp = temp;
}
return 0;
}
#include<iostream>
using namespace std;
struct A
{
int x;
A *next;
};
A *Head;//头指针
int k=0;//记录创建链表个数
A *J_L();//创建链表
void B_J(A *head,int x);//比较大小
void show(A *head);//输出
void main()
{
A *t;
t=J_L();
B_J(t,k);
show(t);
}
void B_J(A *head,int x)
{
A *m,*n;
int swap;
for(int i=0;i<(x-1);i++)
{
n=head;
m=n->next;
for(int j=0;j<(x-i-1);j++)
{
if((n->x)>(m->x))
{swap=n->x;n->x=m->x;m->x=swap;}
n=n->next;
m=n->next;
}
}
}
void show(A *head)
{
A *t=head;
while(t!=NULL)
{
cout<<t->x<<endl;
t=t->next ;
}
}
A *J_L()
{
cout<<"请输入，0退出";
A * p=new A;
k++;
A * d=Head=p;
cin>>p->x;
if(p->x==0)
{
k--;
delete p;Head=0;p=0;
}
while(1)
{
cout<<"请输入，0退出";
p=new A;
k++;
d->next=p;
cin>>p->x;
if(p->x==0)
{k--;delete p;d->next=0;p=0;break;}
d=p;
}
return Head;
}
绛旓細/* -== 鍒ゆ柇鍒涘缓鐨勬槸鍚︽槸涓涓绌洪摼琛 ==- */ while(Nx == 0) { printf("鎮ㄨ鍒涘缓鐨勬槸涓涓┖閾捐〃,鏄惁纭畾?y/n \t"); fflush(stdin); scanf("%c",&flog_nx); if(flog_nx == 'n') { printf("How long do you want input?\t"); fflush(stdin); scanf("%d",&Nx); } else if(...
绛旓細棣栧厛浣犵殑闂鏈夌偣灏忓皬鐨勮瑙ｏ紝澶存寚閽堟剰鎬濅负鎸囧悜閾捐〃澶寸粨鐐圭殑涓涓寚閽堬紝浣犲繀椤昏嚜宸瀹氫箟涓涓閾捐〃缁撶偣绫诲瀷鐨勬寚閽堬紝骞舵寚鍚戦偅涓摼琛ㄧ殑澶寸粨鐐瑰氨鍙互浜唦浣曟潵鑾峰彇涓璇达紝鍥犱负鏈韩灏辨槸浣犺嚜宸卞畾涔夌殑~銆備綘鐨勯棶棰樺簲璇ユ槸濡備綍鑾峰彇鍗曢」閾捐〃鐨勫ご缁撶偣銆傚父瑙佺殑瑙ｅ喅鏂规鍏辨湁浠ヤ笅鍑犵锛1.澹版槑閾捐〃鍚庯紝椹笂瀹氫箟涓涓ご鎸囬拡锛屾寚鍚...
绛旓細if(c<1||c>9){ printf("鎿嶄綔鏁版嵁閿欒!璇烽噸鏂拌緭鍏ラ夐」:\n");return 0;} else return c;} //绛旈绯荤粺 test_test(struct test *p,int n){ int j;int num;int i;int th=0;int tem[100];if(n==0)printf("鐩墠棰樺簱涓繕娌℃湁棰樼洰锛岃杞藉叆棰樺簱鍚庡湪杩涜鎿嶄綔\n");else { printf("...
绛旓細绠鍗曠偣璇村惂锛瀹氫箟涓鐐归摼琛ㄨ妭鐐规ā鏉匡紒灞炴э細瀛︽牎銆佸鐢熷鍚嶃佹у埆銆併佸弬璧涢」鐩佸悕娆°佸緱鍒嗐3涓瓙鍑芥暟銆1杈撳叆閫夋墜淇℃伅锛堟姤鍚嶄俊鎭級銆2杈撳叆閫夋墜寰楀垎淇℃伅銆3銆佺粺璁鍗曢」鎴愮哗骞惰緭鍑恒4缁熻瀛︽牎寰楀垎锛5缁熻瀛︽牎鎬诲垎鎸夊鏍″緱鍒嗚緭鍑烘帓鍚嶏紒鎸夌収鑺傜偣鐨勬煇涓淇℃伅杩涜缁熻涓嶉毦锛佸叧閿槸濡備綍鎸夌収楂樺垎浣庡垎杩涜鎺掑垪鑺傜偣锛佸彲浠...
绛旓細include<stdio.h> #include<stdlib.h> #include<malloc.h> typedef int ElemType; /*鍗曢」閾捐〃澹版槑*/ typedef struct PolynNode{ int coef; // 绯绘暟 int expn; // 鎸囨暟 struct PolynNode *next; }PolynNode,*PolynList; /*浣嶅簭(鎻掕〃灏)杈撳叆n鍏冪礌鍊煎缓绔嬪甫琛ㄧ粨鏋勫崟閾剧嚎鎬...
绛旓細include <stdio.h>#include <string.h>#define MAX_STUDENT_NUM 5 //瀛︾敓涓暟#define MAX_SCORE_NUM 3 //姣忎釜瀛︾敓鎴愮哗涓暟typedef struct student{ char name[32];//濮撳悕 int index; //瀛﹀彿 int score[MAX_SCORE_NUM]; //鍗曢」鎴愮哗鏁扮粍 int avg_score;//骞冲潎鎴愮哗}STUDENT_T;//璁＄畻...
绛旓細浣犳槸鎯抽棶澶存寚閽堢殑瑕佹眰鎶婏紝棣栧厛澶存寚閽堝繀椤绘槸瀵瑰簲鏁版嵁缁撴瀯鐨涓涓鎸囬拡锛歵yprdef struct Node { int data;struct Node *next;}node,*pnode;pnode head = (pnode)malloc(sizeof(node));head->next = NULL; //鍒濆鍖栦负绌 杩欓噷鐨刪ead灏辨槸澶存寚閽堬紝澶存寚閽堜竴鑸唬琛ㄩ摼琛ㄧ殑鍚嶅瓧锛屽叾鏁版嵁鍩熸槸娌℃湁鎰忎箟鐨...
绛旓細include "stdio.h"define N 15 void main(){ int i,sum=0,t=1;for(i=1;i<=N;i+=2){ //娉ㄦ剰鎵鹃掓帹鍏紡 sum += t;//姣涓涓崟椤涔熸湁閫掓帹鍏紡 t=t*(i+1)*(i+2);} printf("1!+3!+...+%d!=%d",N,sum);}
绛旓細sizeof(Pnode));s->data = x;s->next = p->next;p->next = s;return;}if(p->next->data.exp == x.exp) { // 骞傛鐩哥瓑锛屽垯鍚堝苟p->next->data.coef += x.coef;if(fabs(p->data.coef) <= 1E-6) { // 绯绘暟澶皬锛屽垯鍒犻櫎q = p->next;p->next = q->next;...
绛旓細杩欎釜灞炰簬缁撴瀯浣撶殑宓屽瀹氫箟銆傗憼鍏跺疄浣犲凡缁忔敞鎰忓埌浜嗚濉殑绛旀銆傛病閿欙紝next鏍规湰娌℃湁鍑虹幇锛屾墍浠ョ┖鐧藉搴旇濉笂*next銆傝繖鏍凤紝姣忎竴涓妭鐐归兘鏈変竴涓鎸囧悜涓嬩竴涓妭鐐圭殑鎸囬拡锛屾墍浠ラ渶瑕佸祵濂楀畾涔夛紝鍗崇粨鏋勪綋涓畾涔夌粨鏋勪綋銆傗憽绋嬪簭鐨勫姛鑳芥槸鐢ㄧ粨鏋勪綋琛ㄧず瀛︾敓缂栧彿鍜屾垚缁╋紝 stud1鐨勪笅涓涓妭鐐规槸stud2锛宻tud2鐨勪笅涓涓妭鐐...
