-
Notifications
You must be signed in to change notification settings - Fork 0
/
1252 Cells with odd values in a matrix.c
93 lines (70 loc) · 1.84 KB
/
1252 Cells with odd values in a matrix.c
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
int oddCells(int m, int n, int** indices, int indicesSize, int* indicesColSize)
{
int * matrix = (int *)malloc(sizeof(int)* m * n);
memset(matrix, 0x00, sizeof(int)* m * n);
int row_size = m;
int column_size = n;
int matrix_ptr = 0;
int i=0, j=0;
for(i=0; i<indicesSize; i++)
{
int row = indices[i][0];
int column = indices[i][1];
for(j=0; j<column_size; j++)
{
*(matrix + (row * column_size) + j) += 1;
}
for(j=0; j<row_size; j++)
{
*(matrix + (j * column_size) + column) += 1;
}
}
int count = 0;
for(i=0; i<row_size; i++)
{
for(j=0; j<column_size; j++)
{
if((*(matrix + (i*(column_size)) + j)) %2 != 0)
{
count++;
}
}
}
free(matrix);
return count;
}
int oddCells(int m, int n, int** indices, int indicesSize, int* indicesColSize)
{
int * matrix = (int *)malloc(sizeof(int)* m * n);
memset(matrix, 0x00, sizeof(int)* m * n);
int row_size = m;
int column_size = n;
int matrix_ptr = 0;
int i=0, j=0;
for(i=0; i<indicesSize; i++)
{
int row = indices[i][0];
int column = indices[i][1];
for(j=0; j<column_size; j++)
{
*(matrix + (row * column_size) + j) += 1;
}
for(j=0; j<row_size; j++)
{
*(matrix + (j * column_size) + column) += 1;
}
}
int count = 0;
for(i=0; i<row_size; i++)
{
for(j=0; j<column_size; j++)
{
if((*(matrix + (i*(column_size)) + j)) %2 != 0)
{
count++;
}
}
}
free(matrix);
return count;
}