icoding数据结构——数组广义表

4.1

#include "crosslist.h"
#include <stdio.h>
#include <stdlib.h>
 
int init_cross_list(PCrossList L, const ElemType* A, int m, int n)
{
    int i, j, k;
    OLink q, p;
    L->rows = m;
    L->cols = n;
    L->nums = 0;
    if (!(L->rowhead = (OLink*)malloc((m + 1) * sizeof(OLink))))
        return 0;
    if (!(L->colhead = (OLink*)malloc((n + 1) * sizeof(OLink))))
        return 0;
    for (i = 0; i <= m; i++)
        L->rowhead[i] = NULL;
    for (i = 0; i <= n; i++)
        L->colhead[i] = NULL;
    for (i = 0; i < m * n; i++) {
        if (A[i] == 0){
            ;
        }else {
            if (!(p = (OLNode*)malloc(sizeof(OLNode))))
                return 0;
                p->col = (i % n)+1;
            p->row = (i +1-p->col)/n+1;
            
            p->value = A[i];
            p->right = NULL;
            L->nums++;
            p->down = NULL;
            if (L->rowhead[p->row] == NULL)
                L->rowhead[p->row] = p;
            else {
                q = L->rowhead[p->row];
                while (q->right != NULL)
                    q = q->right;
                q->right = p;
            }
            if (L->colhead[p->col] == NULL)
                L->colhead[p->col] = p;
            else {
                q = L->colhead[p->col];
                while (q->down != NULL)
                    q = q->down;
                q->down = p;
            }
        }
    }
    return L->nums;
}
int del_cross_list(PCrossList L, ElemType k)
{
    int count = 0;
    for (int i = 0; i < L->rows+1; ++i) {
        OLink p = L->rowhead[i];
        while (p) {
            if (p->value == k) {
                OLink q;
                for (q = L->rowhead[i]; q != p && q->right != p; q = q->right) {
                }
 
                if (q == p) {
                    L->rowhead[i] = p->right;
                    p = L->rowhead[i];
                    count++;
                    continue;
                } else {
                  
                    q->right = p->right;
                    p = p->right;
                    count++;
                    continue;
                }
            }
            p = p->right;
        }
    }
    for (int i = 0; i < L->cols+1; ++i) {
        OLink p = L->colhead[i];
        while (p != NULL) {
            if (p->value == k) {
                OLink q;
                for (q = L->colhead[i]; q != p && q->down != p; q = q->down) {
                }
                if (q == p) {
                    L->colhead[i] = p->down;
                    p = L->colhead[i];
                    free(q);
                    continue;
                } else {
                    OLink tmp = q->down;
                    q->down = p->down;
                    p = p->down;
                    free(tmp);
                    continue;
                }
            }
            p = p->down;
        }
    }
    return count;

}

 4.2

#include <stdio.h>
#include <stdlib.h>
#include "tsmatrix.h"

bool add_matrix(const TSMatrix *pM, const TSMatrix *pN, TSMatrix *pQ){
    int pM_m=pM->m,pN_m=pN->m,pM_n=pM->n,pN_n=pN->n;
    if(pM_m!=pN_m||pN_n!=pM_n){
        return 0;
    }
    pQ->m=pM_m;
    pQ->n=pM_n;
    int i=0,j=0,s=0,len_Q=0,k=0,l=0;
    while(k<pM->len&&l<pN->len){
        if(pM->data[i].i<pN->data[j].i){
            pQ->data[s].j=pM->data[i].j;
            pQ->data[s].i=pM->data[i].i;
            pQ->data[s].e=pM->data[i].e;
            len_Q++;i++;k++;s++;
        }else if(pM->data[i].i>pN->data[j].i){
            pQ->data[s].i=pN->data[j].i;
            pQ->data[s].j=pN->data[j].j;
            pQ->data[s].e=pN->data[j].e;
            s++;len_Q++;j++;l++;
        }else if(pM->data[i].i==pN->data[j].i&&pM->data[i].j!=pN->data[j].j){
            pQ->data[s].i=pN->data[j].i;
            pQ->data[s].j=pM->data[i].j<pN->data[j].j? pM->data[i].j:pN->data[j].j;
            pQ->data[s].e=pM->data[i].j<pN->data[j].j? pM->data[i].e:pN->data[j].e;
            if(pM->data[i].j<pN->data[j].j){
                i++;k++;
            }else{j++;l++;}
            len_Q++;s++;
        }else if(pM->data[i].i==pN->data[j].i&&pM->data[i].j==pN->data[j].j){
             
             if((pN->data[j].e+pM->data[i].e)==0){
                 i++;j++;k++;l++;
             }else{
                 pQ->data[s].e=pN->data[j].e+pM->data[i].e;
                 len_Q++;
                  pQ->data[s].i=pN->data[j].i;
             pQ->data[s].j=pM->data[i].j;
             i++;j++;k++;l++;s++;
             }
            
        }
        
    }
    while(k==pM->len&&l<pN->len){
        pQ->data[s].i=pN->data[j].i;
         pQ->data[s].j=pN->data[j].j;
          pQ->data[s].e=pN->data[j].e;
          l++;s++;j++;len_Q++;
    }
    while(l==pN->len&&k<pM->len){
        pQ->data[s].i=pM->data[i].i;
         pQ->data[s].j=pM->data[i].j;
          pQ->data[s].e=pM->data[i].e;
          k++;s++;i++;len_Q++;
    }
    pQ->len=len_Q;
    return 1;

}