b.m = a.n; b.n = a.m; b.t = a.t; int q, col, p; int num[a.n+1], cpot[a.n+1]; memset(num, 0, sizeof(num)); for (p = 0; p < a.t; p++) { num[a.data[p].j]++; } cpot[1] = 0; for (col = 2; col <= a.n; col++) { cpot[col] = cpot[col-1] + num[col-1]; } for (p = 0; p < a.t; p++) { col = a.data[p].j; q = cpot[col]; b.data[q].i = a.data[p].j; b.data[q].j = a.data[p].i; b.data[q].v = a.data[p].v; cpot[col]++; } }

补充完整这个代码#include stdioh#include stdlibh#include stringh#include SparseMatrixhvoid inputSPMatrix &a输入采用三元组顺序表存储的矩阵	int p;	scanfddd&am&an&at; 输入矩阵总行数、总列数和非零元素的个数	forp=0;pat;p++		scanfddd&adatapi&adatapj

原文地址: https://www.cveoy.top/t/topic/eHaq 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录