-
Notifications
You must be signed in to change notification settings - Fork 0
/
bsq.c
76 lines (69 loc) · 1.62 KB
/
bsq.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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* bsq.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: lnagy <lnagy@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2016/01/24 21:45:25 by lnagy #+# #+# */
/* Updated: 2016/01/24 21:45:27 by lnagy ### ########.fr */
/* */
/* ************************************************************************** */
#include "bsq.h"
int is_sq(char **map, int i, int j, int size)
{
int c;
int d;
d = i;
while (map[d] && d < i + size)
{
c = j;
while (map[d][c] && c < j + size)
{
if (map[d][c] == map[0][ft_strlen(map[0]) - 2])
{
return (0);
}
c++;
}
if (c != j + size)
return (0);
d++;
}
if (d != i + size)
return (0);
return (1);
}
void biggestsq(char **map, t_sq *sq, int i, int j)
{
int size;
size = sq->size + 1;
while (is_sq(map, i, j, size) == 1)
{
sq->x = i;
sq->y = j;
sq->size = size;
size++;
}
}
t_sq bsq(char **map)
{
t_sq sq;
int i;
int j;
sq.size = 0;
sq.x = 1;
sq.y = 0;
i = 1;
while (map[i])
{
j = 0;
while (map[i][j])
{
biggestsq(map, &sq, i, j);
j++;
}
i++;
}
return (sq);
}