十字链表存储稀疏矩阵

原理借鉴率辉老师的2020天勤数据结构高分笔记P119-P121部分，代码部分未经大量数据验证可能存在bug，欢迎大家指正。

#include <bits/stdc++.h>
using namespace std;
/*
 * 普通节点
 */
typedef struct Node {
	int r, c, v;
	Node *right, *down;
} Node;
/*
 * 头节点 
 */
typedef struct LeaderNode {
	int rnum, cnum, vnum;
	Node *right, *down;
} LeaderNode;
/*
 * 初始化
 */
void leaderNodeinit(LeaderNode &lnode, int r, int c)
{
	lnode.rnum = r;
	lnode.cnum = c;
	lnode.vnum = 0;
	lnode.down = (Node*)malloc(sizeof(Node)*r);
	for (int i = 0; i < r; i++) {
		lnode.down[i].c = lnode.down[i].r = -1;
		lnode.down[i].down = lnode.down[i].right = NULL;
	}
	lnode.right = (Node*)malloc(sizeof(Node)*c);
	for (int i = 0; i < c; i++) {
		lnode.right[i].c = lnode.right[i].r = -1;
		lnode.right[i].down = lnode.right[i].right = NULL;
	}
}
/*
 * 插入一个非0节点 
 */
void insertNode(LeaderNode &lnode, int r, int c, int v)
{
	Node *newNode = (Node*)malloc(sizeof(Node));
	Node *pt = NULL;
	newNode->r = r;
	newNode->c = c;
	newNode->v = v;
	newNode->down = newNode->right = NULL;
	pt = &lnode.down[r];
	while (pt->right != NULL) //这里的可能会有点耗时，可以增加一个记忆节点来优化时间 
		pt = pt->right;
	pt->right = newNode;
	pt = &lnode.right[c];
	while (pt->down != NULL)
		pt = pt->down;
	pt->down = newNode;
	lnode.vnum++; //增添一个非0节点，值+1 
}
/*
 * 按行输出 
 */
void printbyRow(const LeaderNode &lnode)
{
	int row = lnode.rnum;
	cout << lnode.vnum << endl;
	for (int i = 0; i < row; i++) {
		Node *pt = lnode.down[i].right;
		while (pt) {
			cout << pt->r << ", " << pt->c << ", " << pt->v << endl;
			pt = pt->right;
		}
	} 
}
/*
 * 按列输出 
 */
void printbyCol(const LeaderNode &lnode)
{
	int col = lnode.cnum;
	cout << lnode.vnum << endl;
	for (int i = 0; i < col; i++) {
		Node *pt = lnode.right[i].down;
		while (pt) {
			cout << pt->r << ", " << pt->c << ", " << pt->v << endl;
			pt = pt->down;
		}
	}
}
int main()
{
	int row, col, val;
	LeaderNode lnode;
	cin >> row >> col;
	leaderNodeinit(lnode, row, col);
	for (int i = 0; i < row; i++)
		for (int j = 0; j < col; j++) {
			cin >> val;
			if (val != 0)
				insertNode(lnode, i, j, val); //在函数内实现非0值+1 
		}
	cout << "Test by row:" << endl; 
	printbyRow(lnode);
	cout << "Test by col:" << endl;
	printbyCol(lnode);
	return 0;
}

/*测试数据 

4 4
0 0 0 1
0 0 3 2
1 0 0 0
0 2 0 0

*/