#include "crosslist.h"
#include <stdio.h>
#include <stdlib.h>
int init_cross_list(PCrossList L, const ElemType* A, int m, int n)
{
#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->row = (i / n);
p->col = (i % n);
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; ++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) {
}//q 在p前面一个
if (q == p) {//第一个就是 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; ++i) {
OLink p = L->colhead[i];
while (p) {
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;
}
删除的思路:为什么删除的时候要跑两次 横着一次 竖着一次?
因为横着的时候不能删FREE节点 删了竖着的关联关系就没了
所以只能在最后竖着的也找到结点的时候再进行删除
初始化的思路:循环 i/n是行标 i%n是列 记住表头也是一个节点 如果节点对应的行标没有值 则行标直接等于该节点,否则用循环找到最下面的值,再把节点添加进去;