1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
struct
{
int row,col,val;
struct *right,*down;
};
typedef struct NODE;
NODE *a,*b,*c;
NODE* createNullMat(int m, int n)
{
NODE *p,*h,*q;
int k;
h = (NODE*)malloc(sizeof(NODE));
h->row = m;
h->col = n;
h->val = 0;
p = h->right = h->down = h;
for(k = 0; k < m; ++k)
{
q = (NODE*)malloc(sizeof(NODE));
q->col = 1000;
q->right = q;
q->down = p->down;
p->down = q;
p = q;
}
p = h;
for(k = 0; i < n; ++k)
{
q = (NODE*)malloc(sizeof(NODE));
q->row = 1000;
q->down = q;
q->right = p->right;
p->right = q;
p = q;
}
return h;
}
NODE* searchRowLast(NODE *a, int i)
{
NODE *p, *h;
int k;
p = a;
for(k = 0; k <= i; ++k)
p = p->down;
h = p;
while(p->right != h)
p = p->right;
return p;
}
NODE* searchColLast(NODE *a, int j)
{
NODe *p, *h;
int k;
p = a;
for(k = 0; k <= j; ++k)
p = p->right;
h = p;
while(p->down != h)
p = p->down;
return p;
}
void insertNODE(NODE *a, int row, int col, int value)
{
NODE *p, *q, *r;
p = searchRowLast(a, row);
q = searchColLast(a, col);
r = (NODe*)malloc(sizeof(NODE));
r->row = row;
r->col = col;
r->val = value;
r->right = p->right;
p->right = r;
r->down = p->down;
p->down = r;
a->val++;
}
NODE* createMat()
{
int m,n,t,i,j,k,v;
NODE *h, *p, *q, *r;
puts("input row and col and the number of value");
scanf("%d %d %d",&m,&n,&t);
puts("input three tuples");
h = createNullMat(m,n);
h->row = m;
h->col = n;
for(k = 1; k <= t; ++k)
{
scanf("%d %d %d",&i,&j,&v);
insertNODE(i, j, v);
}
return h;
}
NODE* transpositionMat(NODE *a)
{
NODE *TranMat = createNullMat(a->col, a->row);
TranMat->row = a->col;
TranMat->col = a->row;
TranMat->val = a->val;
NODE *h, *p;
p = a->down;
while(p != a)
{
h = p;
h = h->right;
while(h != p)
{
insertNODE(TranMat, h->col, h->row, h->val);
h = h->right;
}
p = p->down;
}
return TranMat;
}
int main()
{
return 0;
}
|
近期评论