第二次大作业,作为自己第一次完整打下来的代码,虽然出现了很多bug,但是都一一找出来的,写得不好,但是我会继续努力的,传上blog,mark一下。
#include <iostream>
#include <cstdio>
using namespace std;
typedef struct Node
{
int i, j, v;
Node *right, *down;
}Node;
typedef struct Crosslist
{
int s;
Node **rHead, **cHead;
}Crosslist;
int Tran (Crosslist &N)
{
int k, flag = 0;
Node *R;
for (k=0; k<N.s; k++)
{
for (R=N.cHead[k]; R!=NULL; R=R->down)
{
if (flag == 0)
{
printf ("%d %d %d", R->j, R->i, R->v);
}
else
printf ("\n%d %d %d", R->j, R->i, R->v);
flag = 1;
}
}
return 0;
}
int Add (Crosslist &N)
{
int k, flag;
Node *R, *S;
for (k=0; k<N.s; k++)
{
R = N.rHead[k];
S = N.cHead[k];
flag = 1;
while (flag == 1)
{
if (R!=NULL &&am