{"id":12,"date":"2022-10-29T00:42:05","date_gmt":"2022-10-28T16:42:05","guid":{"rendered":"https:\/\/shangwendada.co\/?p=12"},"modified":"2022-11-25T00:16:20","modified_gmt":"2022-11-24T16:16:20","slug":"%e6%95%b0%e6%8d%ae%e7%bb%93%e6%9e%84%e5%85%b8%e4%be%8b","status":"publish","type":"post","link":"https:\/\/blog.shangwendada.top\/index.php\/2022\/10\/29\/%e6%95%b0%e6%8d%ae%e7%bb%93%e6%9e%84%e5%85%b8%e4%be%8b\/","title":{"rendered":"\u6570\u636e\u7ed3\u6784\u5178\u4f8b"},"content":{"rendered":"
\n

1.\u6570\u7ec4\u5408\u5e76<\/h2>\n
#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<map>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<set>\n#include<string>\n#include<cstring>\n#include<list>\nusing namespace std;\n\n\/*\n     burn it all down \uff1b\n     cause if I gotta !;\n     \u778e\u5199\u7684\u811a\u672c\n     \u94c1\u6253\u7684\u624b\n\n*\/\n    int n , m ;\nvoid input( int arry[] ,int len )\n{\n    for(int i = 0 ; i < len ; i ++ )\n    {\n        cin >> arry[i] ;\n    }\n}\nvoid output( int arry[] , int len )\n{\n    for(int i = 0 ; i < len ; i ++ )\n    {\n        cout<< arry[i] << " " ;\n    }\n}\nvoid mix(int arrya[],int arryb[], int arryc[] )\n{\n    for(int i = 0 ; i < n ; i ++ )\n    {\n        arryc[i] = arrya[i];\n    }\n    for(int i = n , j = 0 ; i < m + n ; i ++ , j ++  )\n    {\n        arryc[i] = arryb[j];\n    }\n}\nconst int N = 1e5 + 10;\nint main ()\n{\n    int a[N],b[N];\n    int c[N<<1];\n\n    int k;\n    cout<<"\u8f93\u5165\u6570\u7ec4a\u7684\u5927\u5c0f n = " ;\n    cin >> n;\n    cout<<"\u8f93\u5165\u6570\u7ec4b\u7684\u5927\u5c0f m = " ;\n    cin >> m;\n    \/*\n    cout<<"\u8f93\u5165\u6570\u7ec4b\u7684\u5927\u5c0f m = " ;\n    cin >> m;\n    *\/\n    cout<<"\u8f93\u5165a\u6570\u7ec4"<<n<<"\u4e2a\u5143\u7d20"<<endl;\n    input(a, n);\n    cout<<"\u8f93\u5165b\u6570\u7ec4"<<m<<"\u4e2a\u5143\u7d20"<<endl;\n    input(b, m);\n    cout << "a\u6570\u7ec4\u5185\u5bb9:"<<endl;\n    output(a,n);\n    cout<<endl;\n    cout<< "b\u6570\u7ec4\u5185\u5bb9:" <<endl;\n    output(b,m);\n    cout<<endl;\n    \/\/cout<<"\u8bf7\u8f93\u5165\u8981\u8f93\u51fa\u591a\u5c11\u4e2aa\u6570\u7ec4\u5143\u7d20"<<endl;\n    cout<<"\u6570\u7ec4a+b\u5408\u5e76\u540e\u7684\u5185\u5bb9:"<<endl;\n    mix(a,b,c);\n    output(c,m+n);\n\n}\n<\/code><\/pre>\n
\n
2.\u987a\u5e8f\u8868\u7684\u63d2\u5165\u4e0e\u5220\u9664<\/h2>\n
#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<map>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<set>\n#include<string>\n#include<cstring>\n#include<list>\n#include<stdlib.h>\nusing namespace std;\ntypedef int status;\ntypedef int elemtype;\nconst int LIST_INIT_SIZE = 100;\n\ntypedef struct{\n    elemtype *elem;\n    int length;\n    int listsize;\n}sqlist; \n\nstatus initsqlist(sqlist *L)\/\/\u521d\u59cb\u5316 \n{\n    L->elem=(elemtype *)malloc(LIST_INIT_SIZE*sizeof(elemtype));\n    if(L->elem == NULL )\n        return 0;\n    L->length = 0;\n    L->listsize = LIST_INIT_SIZE;\n}\n\nstatus listinsert(sqlist *L ,int i , elemtype e)\/\/\u63d2\u5165 \n{\n    if(i < 0 || i>L->length + 1 )\n    {\n        cout<<"ERROR"<<endl;\n        return 0;\n    }\n    if(L->length >= L->listsize )\n    {\n        elemtype *newbase = (elemtype *)realloc(L->elem , (L->listsize + 10)*sizeof(elemtype) );\n        if(newbase == NULL )\n        {\n            cout<<"ERROR"<<endl;\n            return 0;\n        }\n        L->elem;\n        L->listsize += 10;\n    }\n    elemtype *q = &(L->elem[i-1]);\n    for(elemtype *p = &(L->elem[L->length -1 ]); p >= q ; -- p)\n    {\n        *(p+1)=*p;\n    }\n    *q=e;\n    L->length+=1; \n    return 1;\n}\nstatus listdelete(sqlist *L , int i , elemtype *e)\/\/\u5220\u9664 \n{\n    if(i < 0 || i > L -> length + 1)\n    {\n        cout<<"ERROR"<<endl;\n        return 0;\n    }\n    *e = L->elem[i-1];\n    elemtype *p = &(L->elem[i-1]);\n    elemtype *q = &(L->elem[ L->length -1 ] );\n    for(++p ; p<= q ; p++ )\n    {\n        *(p-1)=*p;\n    }\n    L->length-=1;\n}\nstatus outlist(sqlist *L)\/\/ \u8f93\u51fa\u51fd\u6570 \n{\n    for(int i = 0 ; i <L->length ; i ++ )\n    {\n        cout<<L->elem[i]<<" ";\n    }\n    cout<<endl;\n    return 1;\n}\nint main ()\n{\n    sqlist L;\n    initsqlist(&L);\n    int n,m;\n    cout<<"\u8f93\u5165\u987a\u5e8f\u8868\u7684\u5143\u7d20\u4e2a\u6570:";\n    cin >> n;\n    for(int i = 0 ; i< n ; i ++ )\n    {\n        printf("\u8bf7\u8f93\u5165\u7b2c%d\u4e2a\u5143\u7d20:",i+1);\n        elemtype elem;\n        cin >> elem;\n        listinsert(&L,i+1,elem);\n    }\n    cout<<"\u987a\u5e8f\u8868\u5185\u5143\u7d20:"<<endl;\n    outlist(&L);\n    cout<<"\u8bf7\u8f93\u5165\u9700\u8981\u63d2\u5165\u7684\u5143\u7d20\u548c\u4f4d\u7f6e:"<<endl;\n    elemtype tmp;\n    cin >> tmp >> n;\n    listinsert(&L, n , tmp);\n    cout<<"\u987a\u5e8f\u8868\u5185\u5143\u7d20:"<<endl;\n    outlist(&L);\n    cout<<"\u8f93\u5165\u9700\u8981\u5220\u9664\u7684\u5143\u7d20\u4f4d\u7f6e:";\n    cin >> m ;\n    elemtype e;\n    if(listdelete(&L, m , &e))\n    {\n        cout<<"\u5220\u9664\u6210\u529f!"<<endl;\n        printf("\u5220\u9664\u7684\u5143\u7d20\u662f%d:\\n",e); \n    }\n\n}\n<\/code><\/pre>\n
\n
3.\u987a\u5e8f\u8868\u7684\u6392\u5e8f\u4e0e\u5408\u5e76<\/h2>\n
#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<map>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<set>\n#include<string>\n#include<cstring>\n#include<list>\n#include<stdlib.h>\n#include<windows.h>\nusing namespace std;\ntypedef int status;\ntypedef int elemtype;\nconst int LIST_INIT_SIZE = 100;\n\ntypedef struct{\n    elemtype *elem;\n    int length;\n    int listsize;\n}sqlist; \n\nstatus initsqlist(sqlist *L)\n{\n    L->elem=(elemtype *)malloc(LIST_INIT_SIZE*sizeof(elemtype));\n    if(L->elem == NULL )\n        return 0;\n    L->length = 0;\n    L->listsize = LIST_INIT_SIZE;\n}\n\nstatus listinsert(sqlist &L ,int i ,elemtype e)\n{\n    if(i < 0 || i>L.length + 1 )\n    {\n        cout<<"ERROR"<<endl;\n        return 0;\n    }\n    if(L.length >= L.listsize )\n    {\n        elemtype *newbase = (elemtype *)realloc(L.elem , (L.listsize + 10)*sizeof(elemtype) );\n        if(newbase == NULL )\n        {\n            cout<<"ERROR"<<endl;\n            return 0;\n        }\n        L.elem = newbase ;\n        L.listsize += 10;\n    }\n    elemtype *q = &(L.elem[i-1]);\n    for(elemtype *p = &(L.elem[L.length -1 ]); p >= q ; -- p)\n    {\n        *(p+1)=*p;\n    }\n    *q=e;\n    L.length+=1; \n    return 1;\n}\nstatus listdelete(sqlist *L , int i , elemtype *e)\n{\n    if(i < 0 || i > L -> length + 1)\n    {\n        cout<<"ERROR"<<endl;\n        return 0;\n    }\n    *e = L->elem[i-1];\n    elemtype *p = &(L->elem[i-1]);\n    elemtype *q = &(L->elem[ L->length -1 ] );\n    for(++p ; p<= q ; p++ )\n    {\n        *(p-1)=*p;\n    }\n    L->length-=1;\n}\nstatus outlist(sqlist *L)\n{\n    for(int i = 0 ; i < L->length*2 ; i ++ )\n        cout<<"-";\n    cout<<endl;\n    for(int i = 0 ; i <L->length ; i ++ )\n    {\n        cout<<L->elem[i]<<" ";\n    }\n    cout<<endl;\n    for(int i = 0 ; i < L->length*2 ; i ++ )\n        cout<<"-";\n    cout<<endl;\n    return 1;\n}\n\nstatus greater_sqsort(sqlist &L)\n{\n    int i,qw,q;\n    for(i=1;i<L.length;i++)\n    {\n        q = i-1;\n        qw = L.elem[i]; \n        while(q >= 0&& qw < L.elem[q])    \n        {\n\n            L.elem[q+1] = L.elem[q];\n            q--;    \n        }\n        L.elem[q+1] = qw;\n    } \n    return 1;\n}\n\nstatus less_sqsort(sqlist &L)\n{\n    int i,qw,q;\n    for(i=1;i< L.length;i++)\n    {\n        q = i-1;\n        qw = *(L.elem+i); \n        while(q >= 0&& qw >= *(L.elem+q) )\n        {\n\n            *(L.elem+q+1)= *(L.elem+q);\n            q--;    \n        }\n        *(L.elem+q+1) = qw;\n    } \n    return 1;\n}\nvoid pd(sqlist &L)\n{\n    int d;\n    cout<<"1.\u4ece\u5c0f\u5230\u5927"<<endl;\n    cout<<"2.\u4ece\u5927\u5230\u5c0f"<<endl;\n    cin>> d;\n\n    if(d == 1)\n        greater_sqsort(L);\n    else if(d == 2)\n        less_sqsort(L);\n    else\n    {\n        cout<<"error"<<endl; \n        pd(L);\n\n    }   \n}\n\nvoid sqmerge(sqlist LA,sqlist LB , sqlist &LC)\n{\n    int i = 0 , j = 0 , k = 0 ;\n    while(i < LA.length && j < LB.length )\n    {\n        if( *(LA.elem+i) <= *(LB.elem+j) )\n        {\n        \/\/  elemtype elem = *(LA->elem+i);\n            listinsert(LC,k+1,*(LA.elem+i));\n            i++;\n            k++;\n        }\n        else\n        {\n            listinsert(LC,k+1,*(LB.elem+j));\n            j++;\n            k++;\n        }\n    }\n    while(i<LA.length)\n    {\n        listinsert(LC,k+1,*(LA.elem+i));\n        i++;\n        k++;\n    }\n    while(j<LB.length)\n    {\n        listinsert(LC,k+1,*(LB.elem+j));\n        j++;\n        k++;\n    }\n}\n\nint main ()\n{\n    sqlist L;\n    initsqlist(&L);\n    int n,m;\n    cout<<"\u8f93\u5165\u987a\u5e8f\u8868\u7684\u5143\u7d20\u4e2a\u6570:";\n    cin >> n;\n    for(int i = 0 ; i< n ; i ++ )\n    {\n        printf("\u8bf7\u8f93\u5165\u7b2c%d\u4e2a\u5143\u7d20:",i+1);\n        elemtype elem;\n        cin >> elem;\n        listinsert(L,i+1,elem);\n    }\n    cout<<"\u987a\u5e8f\u8868\u5185\u5143\u7d20:"<<endl;\n    outlist(&L);\n    cout<<"\u8f93\u5165\u6392\u5e8f\u65b9\u5f0f:"<<endl;\n    pd(L);\n    cout<<"\u6392\u5e8f\u540e\u7ed3\u679c\u4e3a:"<<endl;\n    outlist(&L);\n    sqlist Q;\n    initsqlist(&Q);\n    cout<<"\u8f93\u5165\u987a\u5e8f\u88682\u7684\u5143\u7d20\u4e2a\u6570:";\n    cin >> n;\n    for(int i = 0 ; i< n ; i ++ )\n    {\n        printf("\u8bf7\u8f93\u5165\u7b2c%d\u4e2a\u5143\u7d20:",i+1);\n        elemtype elem;\n        cin >> elem;\n        listinsert(Q,i+1,elem);\n    }\n    \/\/listinsert(&Q,2,*(L.elem));\n    cout<<"\u987a\u5e8f\u88682\u5185\u5143\u7d20:"<<endl;\n    outlist(&Q);\n    cout<<"\u8f93\u5165\u6392\u5e8f\u65b9\u5f0f:"<<endl;\n    pd(Q);\n    cout<<"\u6392\u5e8f\u540e\u7ed3\u679c\u4e3a:"<<endl;\n    outlist(&Q);\n    sqlist LC;\n    initsqlist(&LC);\n    sqmerge(L,Q,LC);\n    cout<<"\u88681\u548c\u88682\u5408\u5e76\u540e\u7ed3\u679c\u4e3a:" <<endl;\n    outlist(&LC);\n}\n<\/code><\/pre>\n
\n
4.\u94fe\u8868\u7684\u63d2\u5165\u4e0e\u5220\u9664<\/h2>\n
#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<map>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<set>\n#include<string>\n#include<cstring>\n#include<list>\n#include<stdlib.h>\nusing namespace std;\n\ntypedef struct node{\n    int data;\n    struct node *next;\n}lnode,*linklist; \n\nint initlist(linklist &L)\n{\n    L=(lnode *)malloc(sizeof(lnode));\n    if(L == NULL)\n    {\n        return 0;\n    }\n    L->next = NULL;\n    return 1;\n}\n\nint getlength(linklist L)\n{\n    int length = 0;\n    lnode *p = L->next;\n    while( p )\n    {\n        length ++ ;\n        p = p->next;\n    }\n    return length;\n}\n\nvoid tailinsert(linklist &L,int n)\n{\n    int d;\n    lnode *end;\n    end = L;\n    while(n--)\n    {\n        cin >> d;\n        lnode *p = (linklist)malloc( sizeof(lnode) );\n        p->data = d;\n        end->next = p;\n        end = p;\n    }\n    end->next = NULL;\n}\n\nvoid headinsert(linklist &L,int n)\n{\n    int d;\n    while(n--)\n    {\n        cin >> d;\n        lnode *p = (linklist)malloc( sizeof(lnode) );\n        p->data = d;\n        p->next = L->next;\n        L->next = p;\n    }\n}\nvoid print(linklist &L)\n{\n    lnode *p;\n    p = L;\n    p=p->next;\n    while(p->next!=NULL)\n    {\n        cout<< p->data << " ";\n        p=p->next;\n    }\n    cout<<p->data<<endl;\n}\nvoid listinsert(linklist L,int n , int e)\n{\n    lnode *pre;\n    pre=L;\n    int count = 0;\n    if(n<=0)\n    {\n        printf("\u63d2\u5165\u4f4d\u7f6e\u5c0f\u4e8e0\\n");\n        return ;\n    }\n    while(pre!=NULL && count < n -1 )\n    {\n        pre = pre->next;\n        count ++ ;\n    }\n    if(pre == NULL )\n    {\n        printf("\u63d2\u5165\u4f4d\u7f6e\u8fc7\u5927\\n");\n        return ;\n    }\n    lnode *s = (linklist)malloc( sizeof(lnode) );\n    s->data = e;\n    s->next = pre->next;\n    pre->next = s;\n}\n\nvoid listdel(linklist &L,int n)\n{\n    lnode *pre,*s;\n    pre=L;\n    int count = 0;\n    if(n<=0)\n    {\n        printf("\u5220\u9664\u4f4d\u7f6e\u5c0f\u4e8e0\\n");\n        return ;\n    }\n    while(pre!=NULL && count < n - 1)\n    {\n        pre = pre->next;\n        count ++ ;\n    }\n    if(pre == NULL )\n    {\n        printf("\u5220\u9664\u4f4d\u7f6e\u8fc7\u5927\\n");\n        return ;\n    }\n    s=pre->next;\n    pre->next = s->next;\n    free(s);\n}\nvoid getelem(linklist &L , int n)\n{\n    node *pre ;\n    pre = L;\n    int count;\n    while(pre!=NULL && count < n )\n    {\n        pre=pre->next;\n        count ++;\n    }\n    printf("%d.\u4f4d\u7f6e\u7684\u503c\u4e3a:",n);\n    cout<<pre->data<<endl;\n}\nint main ()\n{\n\n    linklist L;\n    initlist(L);\n    printf("\u8f93\u5165\u94fe\u8868L\u8282\u70b9\u6570:");\n    int n;\n    cin >> n ;\n    cout<<"\u63d2\u5165\u65b9\u5f0f\u9009\u62e9\uff1a"<<endl;\n    cout<<"1.\u5934\u63d2\u6cd5 2.\u5c3e\u63d2\u6cd5"<<endl;\n    int ok = 0;\n    cin >> ok;\n    while(ok != 1&&ok != 2)\n    {\n        cout<<"\u91cd\u65b0\u8f93\u5165"<<endl;\n        cin >> ok;\n    }\n    cout<<"\u8f93\u5165\u94fe\u8868\u5185\u5143\u7d20"<<endl;\n    if(ok==1)\n    {\n        headinsert(L,n);\n    }\n    else\n    {\n        tailinsert(L,n);\n    }\n    cout<<"\u94fe\u8868\u5185\u5143\u7d20:"<<endl;\n    print(L);\n    cout<<"\u8f93\u5165\u63d2\u5165\u5143\u7d20\u4f4d\u7f6e"<<endl;\n    int m;\n    cin >> m ;\n    int data;\n    cout<<"\u8f93\u5165\u5143\u7d20\u7684\u503c"<<endl;\n    cin >> data;\n    listinsert(L,m,data);\n    cout<<"\u94fe\u8868\u5185\u5143\u7d20:"<<endl;\n    print(L);\n    cout<<"\u8f93\u5165\u5220\u9664\u5143\u7d20\u4f4d\u7f6e:"<<endl;\n    cin >> m;\n    listdel(L,m);\n    cout<<"\u94fe\u8868\u5185\u5143\u7d20:"<<endl;\n    print(L);\n    cout<<"\u8f93\u5165\u9700\u8981\u67e5\u8be2\u7684\u5143\u7d20\u4f4d\u7f6e"<<endl; \n    cin >> m;\n    getelem(L,m);\n}\n<\/code><\/pre>\n
\n
5.\u94fe\u8868\u7684\u6392\u5e8f\u4e0e\u5408\u5e76<\/h2>\n
#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<map>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<set>\n#include<string>\n#include<cstring>\n#include<list>\n#include<stdlib.h>\nusing namespace std;\n\ntypedef struct node{\n    int data;\n    struct node *next;\n}lnode,*linklist; \n\nint initlist(linklist &L)\n{\n    L=(lnode *)malloc(sizeof(lnode));\n    if(L == NULL)\n    {\n        return 0;\n    }\n    L->next = NULL;\n    return 1;\n}\n\nint getlength(linklist L)\n{\n    int length = 0;\n    lnode *p = L->next;\n    while( p )\n    {\n        length ++ ;\n        p = p->next;\n    }\n    return length;\n}\n\nvoid tailinsert(linklist &L,int n)\n{\n    int d;\n    lnode *end;\n    end = L;\n    while(n--)\n    {\n        cin >> d;\n        lnode *p = (linklist)malloc( sizeof(lnode) );\n        p->data = d;\n        end->next = p;\n        end = p;\n    }\n    end->next = NULL;\n}\n\nvoid headinsert(linklist &L,int n)\n{\n    int d;\n    while(n--)\n    {\n        cin >> d;\n        lnode *p = (linklist)malloc( sizeof(lnode) );\n        p->data = d;\n        p->next = L->next;\n        L->next = p;\n    }\n}\nvoid print(linklist &L)\n{\n    lnode *p;\n    p = L;\n    p=p->next;\n    while(p!=NULL)\n    {\n        cout<< p->data << " ";\n        p=p->next;\n    }\n \/\/   cout<<p->data<<endl;\n}\nvoid listinsert(linklist L,int n , int e)\n{\n    lnode *pre;\n    pre=L;\n    int count = 0;\n    if(n<=0)\n    {\n        printf("\u63d2\u5165\u4f4d\u7f6e\u5c0f\u4e8e0\\n");\n        return ;\n    }\n    while(pre!=NULL && count < n -1 )\n    {\n        pre = pre->next;\n        count ++ ;\n    }\n    if(pre == NULL )\n    {\n        printf("\u63d2\u5165\u4f4d\u7f6e\u8fc7\u5927\\n");\n        return ;\n    }\n    lnode *s = (linklist)malloc( sizeof(lnode) );\n    s->data = e;\n    s->next = pre->next;\n    pre->next = s;\n}\n\nvoid listdel(linklist &L,int n)\n{\n    lnode *pre,*s;\n    pre=L;\n    int count = 0;\n    if(n<=0)\n    {\n        printf("\u5220\u9664\u4f4d\u7f6e\u5c0f\u4e8e0\\n");\n        return ;\n    }\n    while(pre!=NULL && count < n - 1)\n    {\n        pre = pre->next;\n        count ++ ;\n    }\n    if(pre == NULL )\n    {\n        printf("\u5220\u9664\u4f4d\u7f6e\u8fc7\u5927\\n");\n        return ;\n    }\n    s=pre->next;\n    pre->next = s->next;\n    free(s);\n}\nvoid getelem(linklist &L , int n)\n{\n    node *pre ;\n    pre = L;\n    int count;\n    while(pre!=NULL && count < n )\n    {\n        pre=pre->next;\n        count ++;\n    }\n    printf("%d.\u4f4d\u7f6e\u7684\u503c\u4e3a:",n);\n    cout<<pre->data<<endl;\n}\nvoid greatersort(linklist &L , int count )\n{\n    int i , tmp = 0 ;\n    lnode *pre;\n    for(int i = 0 ; i < count ; i++ )\n    {\n        for(pre = L->next ; pre->next != NULL ; pre=pre->next)\n        {\n            if(pre->data < pre->next->data)\n            {\n                tmp = pre->data;\n                pre->data = pre->next->data;\n                pre->next->data=tmp;\n            }\n        }\n    }\n}\nvoid lesssort(linklist &L , int count )\n{\n    int i , tmp = 0 ;\n    lnode *pre;\n    for(int i = 0 ; i < count ; i++ )\n    {\n        for(pre = L->next ; pre->next != NULL ; pre=pre->next)\n        {\n            if(pre->data > pre->next->data)\n            {\n                tmp = pre->data;\n                pre->data = pre->next->data;\n                pre->next->data=tmp;\n            }\n        }\n    }\n}\nvoid listmix(linklist &L,linklist &L2,linklist &ptr)\n{\n    ptr = L;\n    linklist tmp = ptr;\n    while(tmp->next != NULL)\n    {\n        tmp = tmp->next; \n    }\n    tmp->next = L2->next;\n}\nint main ()\n{\n    linklist L,L2,L3;\n    int n;\n    initlist(L);\n    initlist(L2);\n    initlist(L3);\n    cout<<"\u8f93\u5165\u94fe\u8868L\u7684\u5143\u7d20\u4e2a\u6570:";\n    cin >> n ;\n    cout<<"\u8f93\u5165\u94fe\u8868L\u7684\u5143\u7d20"<<endl;\n    tailinsert(L,n);\n    cout<<"\u8f93\u5165\u94fe\u8868L2\u7684\u5143\u7d20\u4e2a\u6570:";\n    cin >> n;\n    cout<<"\u8f93\u5165\u94fe\u8868L2\u7684\u5143\u7d20"<<endl;\n    tailinsert(L2,n);\n    cout<<"\u6392\u5e8fL:"<<endl;\n    while(1)\n    {\n        cout<<"\u8f93\u51651\u964d\u5e8f\u6392\u5e8f:"<<endl;\n        cout<<"\u8f93\u51652\u5347\u5e8f\u6392\u5e8f:"<<endl;\n        int k;\n        cin >> k;\n        if(k == 1)\n        {\n            greatersort(L,getlength(L));\n            break;\n        }\n        else if (k == 2)\n        {\n            lesssort(L,getlength(L));\n            break;\n        }\n    }\n    cout<<"\u6392\u5e8fL2:"<<endl;\n    while(1)\n    {\n        cout<<"\u8f93\u51651\u964d\u5e8f\u6392\u5e8f:"<<endl;\n        cout<<"\u8f93\u51652\u5347\u5e8f\u6392\u5e8f:"<<endl;\n        int k;\n        cin >> k;\n        if(k == 1)\n        {\n            greatersort(L2,getlength(L2));\n            break;\n        }\n        else if (k == 2)\n        {\n            lesssort(L2,getlength(L2));\n            break;\n        }\n    }\n    cout<<"L\u5185\u5143\u7d20:";\n    print(L);\n    cout<<endl;\n    cout<<"L2\u5185\u5143\u7d20"; \n    print(L2);\n    cout<<endl;\n    listmix(L,L2,L3);\n    cout<<"\u6392\u5e8f\u5408\u5e76\u540e\u7684L1,L2:"<<endl;\n    while(1)\n    {\n        cout<<"\u8f93\u51651\u964d\u5e8f\u6392\u5e8f:"<<endl;\n        cout<<"\u8f93\u51652\u5347\u5e8f\u6392\u5e8f:"<<endl;\n        int k;\n        cin >> k;\n        if(k == 1)\n        {\n            greatersort(L3,getlength(L3));\n            break;\n        }\n        else if (k == 2)\n        {\n            lesssort(L3,getlength(L3));\n            break;\n        }\n    }\n    cout<<"\u5408\u5e76\u540e\u7684L1,L2\u5185\u5143\u7d20:"<<endl;\n    print(L3);\n\n}\n<\/code><\/pre>\n
\n
6.\u6808(\u6570\u636e\u8f6c\u5316)<\/h2>\n
#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<map>\n#include<vector>\n#include<queue>\n#include<set>\n#include<string>\n#include<cstring>\n#include<list>\n#include<stdlib.h>\nusing namespace std;\n#define STACK_INIT_SIZE 100\n#define STACKINCREMENT 10\ntypedef int status;\ntypedef int selemtype;\n\ntypedef struct\n{\n    selemtype *base;\n    selemtype *top;\n    int stacksize ;\n}sqstack;\n\nstatus initstack(sqstack &S)\n{\n    S.base = (selemtype *)malloc(STACK_INIT_SIZE*sizeof(selemtype));\n    if(!S.base)\n    {\n        cout<<"\u521d\u59cb\u5316\u5931\u8d25";\n        exit(0);\n    }\n    S.top = S.base;\n    S.stacksize = STACK_INIT_SIZE;\n    return 1;\n\n}\nstatus push(sqstack &S , selemtype e)\n{\n    if(S.top-S.base>= S.stacksize)\n    {\n        selemtype *newbase=(selemtype *)realloc(S.base,(S.stacksize+STACKINCREMENT)*sizeof(selemtype));\n        if(!newbase)\n        {\n            cout<<"\u5185\u5b58\u4e0d\u8db3\u6808\u7a7a\u95f4\u589e\u52a0\u5931\u8d25"<<endl;\n            return 0;\n        }\n        S.base = newbase;\n        S.top=S.base + S.stacksize;\n        S.stacksize+= STACK_INIT_SIZE;\n    }\n    *(S.top++) = e;\n    return 1;\n}\nstatus pop(sqstack &S, selemtype &e)\n{\n    if(S.top==S.base)\n    {\n        cout<<"\u6808\u5df2\u7a7a"<<endl;\n        return 0;\n    }\n    e =*(--S.top);\n    return 1;\n}\nstatus showstack(sqstack S)\n{\n    while(S.base != S.top )\n    {\n        cout<<*(--S.top)<<" ";\n    }\n    cout <<endl;\n    return 1;\n}\nstatus emptystack(sqstack &S)\n{\n    if(S.top != S.base)\n    {\n        return 0;\n    }\n    else    return 1;\n}\nstatus stacklength(sqstack &S)\n{\n    return (S.top - S.base);\n}\nstatus clearstack (sqstack &S)\n{\n    S.top = S.base;\n    return 1;\n}\nstatus DestroyStack(sqstack &S)\n{\n    free(S.base);\n    S.base=S.top=NULL;\n    S.stacksize=0;\n    return 1;\n}\nstatus TopStack(sqstack &S,int &e)\n{\n    if(S.top==S.base)\n        return 0;\n    e=*(S.top-1);\n    return 1;\n}\nstatus JinZhi(sqstack &S,int e, int jinzhi)\n{\n    while(e)\n    {\n\n        push(S,e%jinzhi);\n        e\/=jinzhi;\n    }\n    return 1;\n}\nstatus ShowjzStack(sqstack &S)\n{\n    while(!emptystack(S))\n    {\n        int ans = 0;\n        pop(S,ans);\n        if(ans < 10)\n        {\n            cout<<ans;\n        }\n        else\n        {\n            char c = ans - 10 + 'A';\n            cout<<c;\n        }\n    }\n\n    return 1;\n}\nint main()\n{\n    sqstack S;\n    initstack(S);\n    int order = 0 ,init = 0,des = 0 ,len = 0,e =  0;\n    cout<<"*----------------\u6808--------------*"<<endl;\n    cout<<"*---------1.\u521d\u59cb\u5316\u6808-------------*"<<endl;\n    cout<<"*---------2.\u9500\u6bc1\u6808---------------*"<<endl;\n    cout<<"*---------3.\u6e05\u7a7a\u6808---------------*"<<endl;\n    cout<<"*---------4.\u6808\u5224\u7a7a---------------*"<<endl;\n    cout<<"*---------5.\u6c42\u6808\u957f\u5ea6-------------*"<<endl;\n    cout<<"*---------6.\u83b7\u53d6\u6808\u9876\u5143\u7d20---------*"<<endl;\n    cout<<"*---------7.\u63d2\u5165\u4e00\u4e2a\u5143\u7d20---------*"<<endl;\n    cout<<"*---------8.\u5220\u9664\u4e00\u4e2a\u5143\u7d20---------*"<<endl;\n    cout<<"*---------9.\u8f93\u51fa\u6240\u6709\u5143\u7d20---------*"<<endl;\n    cout<<"*---------10.\u8fdb\u5236\u8f6c\u6362------------*"<<endl;\n    do{\n        cout<<"\u8bf7\u8f93\u5165\u6307\u4ee4"<<endl;\n        cin >> order;\n        if(order <= 0 || order > 10 )\n        {\n            cout<<"error"<<endl;\n        }\n        else if(!init && order>1 && order!=10)\n                cout<<"\u8bf7\u5148\u521d\u59cb\u5316\u6808"<<endl;\n        else if(des && order>1 && order!=10)\n                cout<<"\u6808\u5df2\u9500\u6bc1\uff0c\u8bf7\u5148\u521d\u59cb\u5316"<<endl;\n        else\n        {\n            switch (order) {\n                case 1:\n                    initstack(S);\n                    init=1;\n                    des = 0;\n                    cout<<"\u6808\u521d\u59cb\u5316\u5df2\u5b8c\u6210"<<endl;\n                    break;\n                case 2:\n                    DestroyStack(S);\n                    cout<<"\u6210\u529f\u9500\u6bc1\u6808"<<endl;\n                    des =  1;\n                    break;\n                case 3:\n                    clearstack(S);\n                    cout<<"\u6808\u5df2\u6e05\u7a7a"<<endl;\n                    break;\n                case 4:\n                    if(!emptystack(S))\n                        cout<<"\u6808\u975e\u7a7a"<<endl;\n                    else\n                        cout<<"\u6808\u4e3a\u7a7a"<<endl;\n                    break;\n                case 5:\n                    len = stacklength(S);\n                    cout<<"\u6808\u957f\u5ea6\u4e3a\uff1a"<<len<<endl;\n                    break;\n                case 6: \n                    if(TopStack(S,e))\n                        cout<<"\u6808\u9876\u5143\u7d20\u4e3a\uff1a"<<e<<endl; \n                    else\n                        cout<<"\u7a7a\u6808\uff0c\u65e0\u6808\u9876\u5143\u7d20"<<endl; \n                    break;\n                case 7:\n                    cout<<"\u8bf7\u8f93\u5165\u63d2\u5165\u5143\u7d20\uff1a";\n                    cin>>e;\n                    push(S,e);\n                    cout<<"\u5165\u6808\u6210\u529f"<<endl;\n                    break;\n                case 8:\n                    if(pop(S,e))\n                        cout<<"\u6808\u9876\u5143\u7d20"<<e<<"\u51fa\u6808\u6210\u529f"<<endl;\n                    else\n                        cout<<"\u6808\u4e3a\u7a7a"<<endl;\n                    break;\n                case 9:\n                    cout<<"\u6808\u4e3a\uff1a"<<endl;\n                    showstack(S);\n                    break;\n                case 10:\n                    cout<<"\u8f93\u5165\u4e00\u4e2a\u5341\u8fdb\u5236\u6570"<<endl;\n                    cin>>e;\n                    cout<<"\u8f93\u5165\u8981\u8f6c\u6362\u7684\u8fdb\u5236"<<endl;\n                    int jinzhi;\n                    cin>>jinzhi;\n                    sqstack J;\n                    initstack(J);\n                    cout<<"10\u8fdb\u5236\u6570"<<e<<"\u8f6c\u6362\u4e3a"<<jinzhi<<"\u8fdb\u5236\u6570\u540e\u4e3a\uff1a";\n                    if(e<0)\n                    {\n                        cout<<'-';\n                        e=-e;\n                    }\n                    if(!e)\n                        cout<<0;\n                    JinZhi(J,e,jinzhi);\n                    ShowjzStack(J);\n                    cout<<endl;\n                    break;\n                default:\n                    cout<<"\u7a0b\u5e8f\u5df2\u9000\u51fa"<<endl;\n                    break;\n            }\n        }\n    }while(order > 0 );\n\n}<\/code><\/pre>\n
\n
7.\u5faa\u73af\u961f\u5217<\/h2>\n
#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<map>\n#include<vector>\n#include<stack>\n#include<set>\n#include<string>\n#include<cstring>\n#include<list>\n#include<stdlib.h>\n#define MAXSIZE 11\nusing namespace std;\ntypedef int status;\ntypedef int elemtype;\n\ntypedef struct {\n    elemtype *base;\n    int front;\n    int rear;\n}sqQuene;\n\nstatus initqueue(sqQuene &Q)\n{\n    Q.base = (elemtype *)malloc(MAXSIZE*sizeof(sqQuene));\n    if(!Q.base)\n    {\n        cout<<"memory error!"<<endl;\n        return 0;\n    }\n    Q.front = Q.rear = 0;\n    return 1;\n}\n\nstatus enqueue(sqQuene &Q , elemtype e)\n{\n    if( (Q.rear + 1)%MAXSIZE == Q.front )\n    {\n        cout<<"queue is full !"<<endl;\n        return 0;\n    }\n    Q.base[Q.rear] = e;\n    Q.rear = (Q.rear+1)%MAXSIZE; \n    return 1;\n\n}\nstatus dequeue(sqQuene &Q , elemtype &e)\n{\n    if(Q.front == Q.rear)\n    {\n        cout<<"There is no any elem!"<<endl;\n        return 0;\n    }\n    e = Q.base[Q.front];\n    Q.front = (Q.front + 1)%MAXSIZE;\n    return 1;\n}\nstatus qulength(sqQuene Q)\n{\n    return (Q.rear - Q.front + MAXSIZE)%MAXSIZE;\n}\n\nint main ()\n{\n    elemtype e;\n    sqQuene Q;\n    initqueue(Q);\n    cout<<"\u5f00\u59cb\u5165\u961f\u603b\u517110\u4e2a\u5143\u7d20"<<endl;\n    for(int i = 0 ; i < MAXSIZE-1 ; i ++ )\n    {\n        cin >> e;\n        enqueue(Q,e);\n    }\n    cout<<"\u51fa\u961f\u4e00\u4e2a\u5143\u7d20"<<endl;\n    dequeue(Q,e);\n    cout<<"\u51fa\u961f\u5143\u7d20\u4e3a:"<<e<<endl;\n    cout<<"\u518d\u5165\u961f\u4e00\u4e2a\u5143\u7d20"<<endl;\n    cin >> e;\n    enqueue(Q,e);\n    cout<<"\u961f\u5217\u957f\u5ea6:"<<qulength(Q)<<endl;\n    cout<<"\u6240\u6709\u5143\u7d20\u51fa\u961f"<<endl;\n    for(int i = 0 ; i < MAXSIZE-1 ; i ++ )\n    {\n        dequeue(Q,e);\n        cout<<e<<" ";\n    }\n    cout<<endl;\n\n    return 0;\n}\n<\/code><\/pre>\n
\n
8.\u5b9a\u957f\u987a\u5e8f\u4e32\u7684\u6c42\u5b50\u4e32\u3001\u4e32\u7684\u5408\u5e76\u7b49<\/h2>\n
#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<map>\n#include<vector>\n#include<stack>\n#include<set>\n#include<string>\n#include<cstring>\n#include<list>\n#include<stdlib.h>\n#define MAXSIZE 11\nusing namespace std;\ntypedef int status;\ntypedef int elemtype;\n\ntypedef struct {\n    elemtype *base;\n    int front;\n    int rear;\n}sqQuene;\n\nstatus initqueue(sqQuene &Q)\n{\n    Q.base = (elemtype *)malloc(MAXSIZE*sizeof(sqQuene));\n    if(!Q.base)\n    {\n        cout<<"memory error!"<<endl;\n        return 0;\n    }\n    Q.front = Q.rear = 0;\n    return 1;\n}\n\nstatus enqueue(sqQuene &Q , elemtype e)\n{\n    if( (Q.rear + 1)%MAXSIZE == Q.front )\n    {\n        cout<<"queue is full !"<<endl;\n        return 0;\n    }\n    Q.base[Q.rear] = e;\n    Q.rear = (Q.rear+1)%MAXSIZE; \n    return 1;\n\n}\nstatus dequeue(sqQuene &Q , elemtype &e)\n{\n    if(Q.front == Q.rear)\n    {\n        cout<<"There is no any elem!"<<endl;\n        return 0;\n    }\n    e = Q.base[Q.front];\n    Q.front = (Q.front + 1)%MAXSIZE;\n    return 1;\n}\nstatus qulength(sqQuene Q)\n{\n    return (Q.rear - Q.front + MAXSIZE)%MAXSIZE;\n}\n\nint main ()\n{\n    elemtype e;\n    sqQuene Q;\n    initqueue(Q);\n    cout<<"\u5f00\u59cb\u5165\u961f\u603b\u517110\u4e2a\u5143\u7d20"<<endl;\n    for(int i = 0 ; i < MAXSIZE-1 ; i ++ )\n    {\n        cin >> e;\n        enqueue(Q,e);\n    }\n    cout<<"\u51fa\u961f\u4e00\u4e2a\u5143\u7d20"<<endl;\n    dequeue(Q,e);\n    cout<<"\u51fa\u961f\u5143\u7d20\u4e3a:"<<e<<endl;\n    cout<<"\u518d\u5165\u961f\u4e00\u4e2a\u5143\u7d20"<<endl;\n    cin >> e;\n    enqueue(Q,e);\n    cout<<"\u961f\u5217\u957f\u5ea6:"<<qulength(Q)<<endl;\n    cout<<"\u6240\u6709\u5143\u7d20\u51fa\u961f"<<endl;\n    for(int i = 0 ; i < MAXSIZE-1 ; i ++ )\n    {\n        dequeue(Q,e);\n        cout<<e<<" ";\n    }\n    cout<<endl;\n\n    return 0;\n}\n<\/code><\/pre>\n
\n
9.\u4e32\u7684\u6a21\u5f0f\u5339\u914d<\/h2>\n
#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<map>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<set>\n#include<string>\n#include<cstring>\n#include<list>\n#include<stdlib.h>\nusing namespace std;\ntypedef int status;\ntypedef int selemtype;\n#define TURE 1\n#define FALSE 0\n#define OK 1\n#define ERROR 0\n#define MAXLEN 255\ntypedef int status;\ntypedef char sstring[MAXLEN+1];\n\nvoid stringassign(sstring &t, char s[])\n{\n\n    t[0] = strlen(s);\n    if(strlen(s) > MAXLEN)\n    {\n        cout<<"the string overflow!!!"<<endl;\n        return ;\n    }\n    for(int i = 0 ; i < t[0] ; i ++)\n    {\n        t[i+1]=s[i];    \n    }\n\n}\nvoid output(sstring s)\n{\n    for(int i = 1 ; i <= s[0] ; i ++ )\n    {\n        printf("%c",s[i]);\n    }\n}\n\nvoid concat(sstring &T, sstring s1, sstring s2) \n{\n    int i, j, uncut;\n    if (s1[0] + s2[0] <= MAXLEN)\n    {\n        for (i = 1; i<= s1[0]; i++)\n            T[i] = s1[i];\n        for (j = 0; j< s2[0]; j++)\n            T[i + j] = s2[j+1];\n        T[0] = s1[0] + s2[0];\n    }\n    else if (s1[0]< MAXLEN)\n    {\n        for (i = 1; i<s1[0]; i++)\n            T[i] = s1[i];\n        for (j = 1; j< MAXLEN - s1[0]; j++)\n            T[i + j] = s2[j];\n        T[0] = s1[0] + j;\n    }\n    else if (s1[0] ==  MAXLEN)\n    {\n        for (i = 1; i<s1[0]; i++)\n            T[i] = s1[i];\n        T[0] = s1[0];\n        uncut = FALSE;\n    }\n}\nint substring(sstring &sub, sstring s, int pos, int len)\n{\n    if (pos<1 || pos>s[0] || len<0 || len>s[0] - pos + 1)\n    {\n        cout<<"\u8be5\u5b50\u4e32\u4e0d\u5b58\u5728"<<endl;\n        return 0;\n    }\n    for (int i = 1; i <= len; i++)\n        sub[i] = s[pos - 1 + i];\n    sub[0] = len;\n    return OK;\n}\nint stringcmp(sstring T,sstring T2)\n{\n    int i = 1;\n    int t = 0;\n    while( i<=T[0]&&i<=T2[0] )\n    {\n        if(T[i] == T2[i])\n            i++;\n        else\n        {\n            t = T[i] - T2[i];\n            if ( t < 0 )\n            {\n                return -1;\n            }\n            else\n            {\n                return 1;\n            }\n        }\n    }\n    if( i > T[0]&&i>T2[0])\n        return 0;\n    else\n    {\n        if(i>T[0])\n        {\n            return -1;\n        }\n        else{\n            return 1;\n        }\n    }\n}\n\nint index(sstring S,sstring T,int pos)\n{\n    if(pos<1)\n    {\n        return 0;\n    }\n    int n = S[0],m=T[0];\n    int i = pos;\n    while(i <= n - m + 1)\n    {\n        sstring  sub;\n        substring(sub,S,i,m);\n        if(stringcmp(sub,T)!=0)\n        {\n            i++;\n        }\n        else return i;\n    }\n    return 0;\n\n}\nint index2(sstring S, sstring T,int pos)\n{\n    for(int i = 1 ; i<=S[0]-T[0]+1 ; i ++  )\n    {\n        int j = 1;\n        while(j<=T[0])\n        {\n            if(S[i]==T[i])\n            {\n                j++;\n            }\n            else{\n                break;\n            }\n        }\n        if(j>=T[0])\n        {\n            return i;\n        }\n    }\n    return 0;\n}\n\nint main ()\n{\n    char s1[255555],s2[255];\n    sstring t1,t2,t;\n    cout<<"\u8bf7\u8f93\u5165\u5b57\u7b26\u4e32s1"<<endl;\n    gets(s1);\n    cout<<"\u8bf7\u8f93\u5165\u5b57\u7b26\u4e32s2"<<endl;\n    gets(s2);\n    stringassign(t1,s1);\n    stringassign(t2,s2);\n    if(!stringcmp(t1,t2))\n    {\n        cout<<"s1\u7b49\u4e8es2"<<endl;\n    }\n    else if (stringcmp(t1,t2)==1)\n    {\n        cout<<"s1\u5927\u4e8es2"<<endl;\n    }\n    else\n    {\n        cout<<"s1\u5c0f\u4e8es2"<<endl;\n    }\n    cout<<"\u8f93\u5165\u4e3b\u4e32:"<<endl;\n    char s3[25555],s4[2555];\n    gets(s3);\n    sstring t3,t4;\n    stringassign(t3,s3);\n    cout<<"\u8f93\u5165\u6a21\u5f0f\u4e32:"<<endl;\n    gets(s4);\n    stringassign(t4,s4);\n    int pos= 0;\n    cout<<"\u8f93\u5165\u5728\u591a\u5c11\u4f4d\u540e\u67e5\u627e\u6a21\u5f0f\u4e32:"<<endl;\n    cin >> pos;\n    cout<<"\u6a21\u5f0f1:"<<endl;\n    if(index(t3,t4,pos))\n    {\n        cout<<"\u6a21\u5f0f\u4e32\u4f4d\u7f6e\u4e3a: "<<index(t3,t4,pos)<<endl;\n    }\n    else{\n        cout<<"\u67e5\u8be2\u5931\u8d25"<<endl;   \n    }\n    cout<<"\u6a21\u5f0f2:"<<endl;\n    if(index2(t3,t4,pos))\n    {\n    cout<<"\u6a21\u5f0f\u4e32\u4f4d\u7f6e\u4e3a: "<<index(t3,t4,pos)<<endl;\n    }\n    else{\n        cout<<"\u67e5\u8be2\u5931\u8d25"<<endl;   \n    }\n    return 0;\n}<\/code><\/pre>\n
\n
10.\u7a00\u758f\u77e9\u9635\u7684\u4e24\u79cd\u8f6c\u7f6e\u8fd0\u7b97<\/h2>\n
#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<map>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<set>\n#include<string>\n#include<cstring>\n#include<list>\n#include<stdlib.h>\n\n#define ok 1\n#define MAX 12500\n\nusing namespace std;\ntypedef int status;\ntypedef int elemtype;\nint num[MAX];\nint cpot[MAX];\ntypedef struct \n{\n    int i , j ;\n    elemtype e;\n}triple;\ntypedef struct\n{\n    triple data[MAX];\n    int mu,nu,tu;\n}TM;\n\nvoid Create(TM &M)\n{\n    printf("\u8bf7\u8f93\u5165\u603b\u884c\uff0c\u603b\u5217\uff0c\u975e\u96f6\u5143\u7d20\u7684\u4e2a\u6570\\n");\n    cin >> M.mu>>M.nu>>M.tu;\n    cout<<"\u884c\u53f7\uff0c\u5217\u53f7\uff0c\u503c"<<endl;\n    for(int t = 1 ; t <= M.tu ; t ++ )\n    {\n        cin >> M.data[t].i>>M.data[t].j>>M.data[t].e;\n    }\n}\nstatus Print(TM G)      \/\/\u6253\u5370\u7a00\u758f\u77e9\u9635 \n{\n    int k=1;\n    for(int i=1;i<=G.mu;i++)\n    {\n        for(int j=1;j<=G.nu;j++)\n        {\n            if(G.data[k].i == i && G.data[k].j == j)\n            {\n                printf("%4d",G.data[k].e);\n                k++;\n            }   \n            else\n                printf("   0");\n        }\n        cout<<endl;\n    }\n    return 1;\n}\nstatus TransposeSMatrix1(TM M,TM &T) \n{\n    int col,p,q,t;\n    \/\/\u4e00\u4e2a\u77e9\u9635\u548c\u5b83\u7684\u8f6c\u7f6e\u77e9\u9635\u7684\u884c\u548c\u5217\u76f8\u53cd \n    T.mu = M.nu;        \n    T.nu = M.mu;\n    T.tu = M.tu;\n    if(T.tu)\n    {\n        for(col=1;col<=M.nu;++col)\n            num[col] = 0;\n        for(t=1;t<=M.tu;++t)      \n            ++num[M.data[t].j];\n        cpot[1] = 1;                 \n        for(col=2;col<=M.nu;++col)\n            cpot[col] = cpot[col-1] + num[col-1];\n\n        for(p=1;p<=M.tu;++p)\n        {\n            col = M.data[p].j;\n            q = cpot[col];\n            T.data[q].i = M.data[p].j;      \n            T.data[q].j = M.data[p].i;\n            T.data[q].e = M.data[p].e;      \n            ++cpot[col];\n        }\n    }\n    return 1;\n}\nstatus TransposeSMatrix2(TM &G,TM &T)\n{\n    int k=1;\n    T.mu = G.nu;\n    T.nu = G.mu;\n    T.tu = G.tu;\n    int col = 0 , p = 0;\n    for(int col=1;col<=G.nu;col++)\n    {\n        for(int p=1;p<=G.tu;p++)\n        {\n            if(G.data[p].j == col )\n            {\n                T.data[k].i = G.data[p].j;\n                T.data[k].j = G.data[p].i;\n                T.data[k].e = G.data[p].e;\n                k++;\n            }\n        }\n    }\n    return 1;\n}\nvoid outTM(TM M)\n{\n    int i;\n\n    printf("\u77e9\u9635\u7684\u603b\u884c\u3001\u603b\u5217\u3001\u603b\u975e0\u5143\u7d20\u7684\u4e2a\u6570\uff1a\\n");\n    printf("%4d%4d%4d\\n", M.mu, M.nu, M.tu);\n\n    printf("---------------\\n");\n    printf("   i   j   v\\n");\n    printf("---------------\\n");\n    for (i = 1; i <= M.tu; i++)\n    {\n        printf("%4d%4d%4d\\n", M.data[i].i, M.data[i].j, M.data[i].e);\n    }\n    printf("---------------\\n");\n}\n\nint main ()\n{\n    TM M,T,T2;\n    Create(M);\n    cout<<"\u77e9\u9635\u4e3a:"<<endl;\n\/\/  Print(M);\n    cout<<"\u4e09\u5143\u7ec4:"<<endl;\n    outTM(M);\n    TransposeSMatrix1(M,T);\n    cout<<"\u4f7f\u7528\u7b2c\u4e00\u79cd\u65b9\u6cd5\u8f6c\u7f6e\u7684\u77e9\u9635\u4e3a:"<<endl;\n\/\/  Print(T);\n    cout<<"\u4e09\u5143\u7ec4:"<<endl;\n    outTM(T);\n    TransposeSMatrix2(M,T2);\n    cout<<"\u4f7f\u7528\u7b2c\u4e8c\u79cd\u65b9\u6cd5\u8f6c\u7f6e\u7684\u77e9\u9635\u4e3a:"<<endl;\n\/\/  Print(T2);\n    outTM(T2);\n}\n\/*\ntest \n6 7 8\n\n1 2 12\n1 3 9\n3 1 -3\n3 6 14\n4 3 24\n5 2 18\n6 1 15\n6 4 -7\n*\/<\/code><\/pre>\n
\n
11.\u4e8c\u53c9\u6811\u7684\u521b\u5efa\u53ca\u9012\u5f52\u7684\u524d\u3001\u4e2d\u3001\u540e\u5e8f\u904d\u5386<\/h2>\n
#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<map>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<set>\n#include<string>\n#include<cstring>\n#include<list>\n#include<stdlib.h>\nusing namespace std;\ntypedef int status;\ntypedef int selemtype;\n\n#define ok 1\n#define error 0\n\ntypedef struct bitnode\n{\n    char data;\n    struct bitnode *lchild,*rchild;\n}Bitnode,*Bitree;\n\nstatus creatbitree(Bitree &t)\n{\n    char ch;\n    ch=getchar();\n    if(ch == ' ')\n    {\n        t=NULL;\n    }\n    else{\n        t=(Bitree)malloc(sizeof(Bitnode));\n        t->data=ch;\n        creatbitree(t->lchild);\n        creatbitree(t->rchild);\n    }\n    return 1;\n}\nvoid preorder(Bitree root)\/\/\u9012\u5f52\u5148\u5e8f\u904d\u5386 \n{\n    if(root)    \n    {\n        printf("%c",root->data);\n        preorder(root->lchild);\n        preorder(root->rchild);\n    }\n}\nvoid Inorder(Bitree root)\n{\n\n    if(root)    \n    {\n        Inorder(root->lchild);\n        printf("%c",root->data);\n        Inorder(root->rchild);\n    }\n}\nvoid postorder(Bitree root)\n{\n\n    if(root)    \n    {\n        postorder(root->lchild);\n        postorder(root->rchild);\n        printf("%c",root->data);\n\n    }\n}\n\nint main ()\n{\n    Bitree T;\n    creatbitree(T);\n    cout<<endl;\n    cout<<"\u5148\u5e8f\u904d\u5386\u7ed3\u679c\u4e3a:";\n    preorder(T);\n    cout<<endl;\n    cout<<"\u4e2d\u5e8f\u904d\u5386\u7ed3\u679c\u4e3a:";\n    Inorder(T);\n    cout<<endl;\n    cout<<"\u540e\u5e8f\u904d\u5386\u7ed3\u679c\u4e3a:";\n    postorder(T);\n\n}\n<\/code><\/pre>\n
\n
12.\u4e8c\u53c9\u6811\u7684\u521b\u5efa\u53ca\u975e\u9012\u5f52\u7684\u524d\u5e8f\u4e0e\u4e8c\u79cd\u4e2d\u5e8f\u904d\u5386<\/h2>\n
#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<map>\n#include<vector>\n#include<queue>\n#include<set>\n#include<string>\n#include<cstring>\n#include<list>\n#include<stdlib.h>\nusing namespace std;\n#define STACK_INIT_SIZE 100\n#define STACKINCREMENT 10\ntypedef int status;\ntypedef struct bitnode\n{\n    char data;\n    struct bitnode *lchild,*rchild;\n}Bitnode,*Bitree;\n\ntypedef Bitree selemtype;\nstatus creatbitree(Bitree &t)\n{\n    char ch;\n    ch=getchar();\n    if(ch == ' ')\n    {\n        t=NULL;\n    }\n    else{\n        t=(Bitree)malloc(sizeof(Bitnode));\n        t->data=ch;\n        creatbitree(t->lchild);\n        creatbitree(t->rchild);\n    }\n    return 1;\n}\nvoid preorder(Bitree root)\/\/\u9012\u5f52\u5148\u5e8f\u904d\u5386 \n{\n    if(root)    \n    {\n        printf("%c",root->data);\n        preorder(root->lchild);\n        preorder(root->rchild);\n    }\n}\nvoid inorder(Bitree root)\n{\n\n    if(root)    \n    {\n        inorder(root->lchild);\n        printf("%c",root->data);\n        inorder(root->rchild);\n    }\n}\nvoid postorder(Bitree root)\n{\n\n    if(root)    \n    {\n        postorder(root->lchild);\n        postorder(root->rchild);\n        printf("%c",root->data);\n\n    }\n}\n\ntypedef struct\n{\n    selemtype *base;\n    selemtype *top;\n    int stacksize ;\n}sqstack;\n\nstatus initstack(sqstack &S)\n{\n    S.base = (selemtype *)malloc(STACK_INIT_SIZE*sizeof(selemtype));\n    if(!S.base)\n    {\n        cout<<"\u521d\u59cb\u5316\u5931\u8d25";\n        exit(0);\n    }\n    S.top = S.base;\n    S.stacksize = STACK_INIT_SIZE;\n    return 1;\n\n}\nstatus push(sqstack &S , selemtype e)\n{\n    if(S.top-S.base>= S.stacksize)\n    {\n        selemtype *newbase=(selemtype *)realloc(S.base,(S.stacksize+STACKINCREMENT)*sizeof(selemtype));\n        if(!newbase)\n        {\n            cout<<"\u5185\u5b58\u4e0d\u8db3\u6808\u7a7a\u95f4\u589e\u52a0\u5931\u8d25"<<endl;\n            return 0;\n        }\n        S.base = newbase;\n        S.top=S.base + S.stacksize;\n        S.stacksize+= STACK_INIT_SIZE;\n    }\n    *(S.top++) = e;\n    return 1;\n}\nstatus pop(sqstack &S, selemtype &e)\n{\n    if(S.top==S.base)\n    {\n        cout<<"\u6808\u5df2\u7a7a"<<endl;\n        return 0;\n    }\n    e =*(--S.top);\n    return 1;\n}\nstatus showstack(sqstack S)\n{\n    while(S.base != S.top )\n    {\n        cout<<*(--S.top)<<" ";\n    }\n    cout <<endl;\n    return 1;\n}\nstatus emptystack(sqstack &S)\n{\n    if(S.top != S.base)\n    {\n        return 0;\n    }\n    else    return 1;\n}\nstatus stacklength(sqstack &S)\n{\n    return (S.top - S.base);\n}\nstatus clearstack (sqstack &S)\n{\n    S.top = S.base;\n    return 1;\n}\nstatus DestroyStack(sqstack &S)\n{\n    free(S.base);\n    S.base=S.top=NULL;\n    S.stacksize=0;\n    return 1;\n}\nstatus TopStack(sqstack &S,selemtype &e)\n{\n    if(S.top==S.base)\n        return 0;\n    e=*(S.top-1);\n    return 1;\n}\n\nvoid Preorder(Bitree T)\n{\n    sqstack S;\n    initstack(S);\n    Bitnode *p;\n    p = T;\n    while(p || !emptystack(S))\n    {\n        if(p)\n        {\n            printf("%c",p->data);\n            push(S,p);\n            p= p->lchild;\n        }\n        else\n        {\n            pop(S,p);\n            p=p->rchild; \n        }\n    }\n}\nvoid Inorder(Bitree T)\n{\n    sqstack S;\n    initstack(S);\n    Bitnode *p;\n    p = T;\n    while(p || !emptystack(S))\n    {\n        if(p)\n        {\n            push(S,p);\n            p = p->lchild;\n        }\n        else\n        {\n            pop(S,p);\n            printf("%c",p->data);\n            p = p->rchild;\n        }\n    }\n}\nvoid Inorder2(Bitree T)\n{\n    sqstack S;\n    initstack(S);\n    Bitnode *p;\n    p = T;\n    push(S,p);\n    while(!emptystack(S))\n    {\n        while(TopStack(S,p)&&p)\n        {\n            push(S,p->lchild);\n        }\n        pop(S,p);\n        if(!emptystack(S))\n        {\n            pop(S,p);\n            printf("%c",p->data);\n            push(S,p->rchild);\n        }\n    }\n}\n\nint main()\n{\n    Bitree T;\n    creatbitree(T);\n    cout<<endl<<"\u975e\u9012\u5f52\u5148\u5e8f\u904d\u5386:"<<endl;\n    Preorder(T);\n    cout<<endl<<"\u9012\u5f52\u5148\u5e8f\u904d\u5386:"<<endl;\n    preorder(T);\n    cout<<endl<<"\u975e\u9012\u5f52\u4e2d\u5e8f,\u7a7a\u4e0d\u8fdb\u6808:"<<endl;\n    Inorder(T);\n    cout<<endl<<"\u975e\u9012\u5f52\u4e2d\u5e8f,\u7a7a\u8fdb\u6808"<<endl;\n    Inorder2(T);\n    cout<<endl<<"\u9012\u5f52\u4e2d\u5e8f"<<endl;\n    inorder(T);\n}<\/code><\/pre>\n
\n
13.\u54c8\u592b\u66fc\u6811\u4e0e\u54c8\u592b\u66fc\u7f16\u7801\u7684\u6784\u9020<\/h2>\n
#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<map>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<set>\n#include<string>\n#include<cstring>\n#include<list>\n#include<stdlib.h>\nusing namespace std;\ntypedef int status;\ntypedef int selemtype;\n\ntypedef struct\n{\n    int weight;\n    int parent,lchird,rchild;\n}HTNode,*HuffmanTree;\n\ntypedef char** HuffmanCode;\n\nvoid Select(HuffmanTree t,int n ,int &s1, int &s2)\n{\n    int temp;\n    temp = 99999;\n    for(int i = 1 ; i<= n ; i ++ )\n    {\n        if(t[i].weight<temp && t[i].parent == 0 )\n        {\n            temp=t[i].weight;\n            s1 = i;\n        }\n    }   \n    temp = 99999;\n    for(int i = 1 ; i <= n ; i++ )\n    {\n        if(t[i].weight<temp && t[i].parent == 0 &&i!=s1)\n        {\n            temp = t[i].weight;\n            s2 = i;\n        }\n    }\n}\nvoid InitHuffmanTree(HuffmanTree &H,int n)\n{\n    if(n<=1) return ;\n    int m=2*n-1;\n    H= (HTNode *)malloc( (m+1)*sizeof(HTNode) );\/\/new HTNode[m+1];\n    for (int i = 1; i <= m; i++)\n    {\n        H[i].parent=0;\n        H[i].lchird=0;\n        H[i].rchild=0;\n    }\n    for (int i = 1; i <= n; i++)\n    {\n        cin>>H[i].weight;\n    }\n}\n\nvoid CreateHuffmanTree(HuffmanTree &H,int n)\n{\n    int m=2*n-1;\n    int s1,s2;\n    for (int i = n+1; i <= m; i++)\n    {\n        Select(H,i-1,s1,s2);\n        H[s1].parent=i; H[s2].parent=i;\n        H[i].lchird=s1; H[i].rchild=s2;\n        H[i].weight=H[s1].weight+H[s2].weight;\n    }\n}\n\nvoid CreateHuffmanCode(HuffmanTree H,HuffmanCode &HC,int n)\n{\n    HC=new char*[n+1];\n    char* cd=new char[n];\n    cd[n-1]='\\0';\n    for (int i = 1; i <= n; i++)\n    {\n        int start=n-1;\n        int c=i;\n        int f=H[i].parent;\n        while (f!=0)\n        {\n            --start;\n            if (H[f].lchird==c)\n            {\n                cd[start]='0';\n            }\n            else cd[start]='1';\n            c=f;\n            f=H[f].parent;\n        }\n        HC[i]=new char[n-start];\n        strcpy(HC[i],&cd[start]);\n    }\n    delete cd; \n}\nvoid out(HuffmanTree t, int n)\n{\n    int i;\n\n    printf("     w     p     l     r\\n");\n    printf("------------------------\\n");\n    for (i = 1; i <= 2 * n - 1; i++)\n    {\n        printf("%6d%6d%6d%6d\\n", t[i].weight, t[i].parent, t[i].lchird, t[i].rchild);\n    }\n    printf("------------------------\\n");\n}\nint main()\n{\n    HuffmanTree H;\n    HuffmanCode HC;\n    int n;\n    cout<<"\u8bf7\u8f93\u5165\u54c8\u592b\u66fc\u6811\u7684\u8282\u70b9\u6570:"<<endl;\n    cin>>n;\n    cout<<"\u8f93\u5165\u6bcf\u4e2a\u8282\u70b9\u7684\u6743\u503c:"<<endl;\n    InitHuffmanTree(H,n);\n    CreateHuffmanTree(H,n);\n    CreateHuffmanCode(H,HC,n);\n    out(H,n);\n    for (int i = 1; i <= n; i++)\n    {\n        printf("H[%d] = %d \u54c8\u592b\u66fc\u7f16\u7801\u4e3a:",i,H[i].weight);\n        cout<<HC[i]<<endl;\n    }\n    return 0;\n}\n\/*\ntest\n8\n3 5 11 23 29 14 7 8 \n*\/\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
1.\u6570\u7ec4\u5408\u5e76 #include<iostream> #include<algorithm&g […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6],"tags":[],"class_list":["post-12","post","type-post","status-publish","format-standard","hentry","category-sec"],"_links":{"self":[{"href":"https:\/\/blog.shangwendada.top\/index.php\/wp-json\/wp\/v2\/posts\/12","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.shangwendada.top\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.shangwendada.top\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.shangwendada.top\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.shangwendada.top\/index.php\/wp-json\/wp\/v2\/comments?post=12"}],"version-history":[{"count":10,"href":"https:\/\/blog.shangwendada.top\/index.php\/wp-json\/wp\/v2\/posts\/12\/revisions"}],"predecessor-version":[{"id":201,"href":"https:\/\/blog.shangwendada.top\/index.php\/wp-json\/wp\/v2\/posts\/12\/revisions\/201"}],"wp:attachment":[{"href":"https:\/\/blog.shangwendada.top\/index.php\/wp-json\/wp\/v2\/media?parent=12"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.shangwendada.top\/index.php\/wp-json\/wp\/v2\/categories?post=12"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.shangwendada.top\/index.php\/wp-json\/wp\/v2\/tags?post=12"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}