参考代码:
#include<stdio.h> #include<malloc.h> typedef struct node { int i, j; int data; struct node *right, *down; } node; typedef struct CrossList { node **rhead, **chead; int mu, nu, tu; } CrossList; void CreateCrossList(CrossList *M); void DisplayCrossList(CrossList *M); int main() { CrossList M; CreateCrossList(&M); DisplayCrossList(&M); return 0; } void CreateCrossList(CrossList *M) { int i, j, data; node *p, *q; scanf("%d%d", &M->mu, &M->nu); M->tu = 0; M->rhead = (node **)malloc(sizeof(node *) * (M->mu + 1)); M->chead = (node **)malloc(sizeof(node *) * (M->nu + 1)); for (i = 1; i <= M->mu; i++) { p = (node *)malloc(sizeof(node)); M->rhead[i] = p; p->right = NULL; } for (j = 1; j <= M->nu; j++) { q = (node *)malloc(sizeof(node)); M->chead[j] = q; q->down = NULL; } for (i = 1; i <= M->mu; i++) { for (j = 1; j <= M->nu; j++) { scanf("%d", &data); if (data) { p = (node *)malloc(sizeof(node)); p->i = i; p->j = j; p->data = data; p->right = NULL; p->down = NULL; // 找到插入位置上一个结点 for (q = M->rhead[i]; q->right && j > q->right->j; q = q->right); p->right = q->right; q->right = p; for (q = M->chead[j]; q->down && i > q->down->i; q = q->down); p->down = q->down; q->down = p; M->tu++; } } } } void DisplayCrossList(CrossList *M) { int i, j; node *p; for (i = 1; i <= M->mu; i++) { for (j = 1, p = M->rhead[i]->right; j <= M->nu; j++) { if (p && j == p->j) { printf("%d ", p->data); p = p->right; } else { printf("0 "); } } printf("\n"); } }
0.0分
5 人评分
C二级辅导-同因查找 (C语言代码)浏览:564 |
C语言训练-求1+2!+3!+...+N!的和 (C语言代码)浏览:2468 |
C语言程序设计教程(第三版)课后习题6.1 (C语言代码)浏览:629 |
WU-蓝桥杯算法提高VIP-企业奖金发放 (C++代码)浏览:1176 |
【简单计算】 (C语言代码)浏览:622 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:482 |
WU-拆分位数 (C++代码)浏览:788 |
【绝对值排序】 (C语言代码)浏览:825 |
2003年秋浙江省计算机等级考试二级C 编程题(2) (C语言代码)浏览:594 |
理财计划 (C语言代码)浏览:468 |