-
Notifications
You must be signed in to change notification settings - Fork 0
/
ft_isvalid.c
112 lines (102 loc) · 2.12 KB
/
ft_isvalid.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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_isvalid.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: pfischof <pfischof@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2016/01/10 17:40:19 by pfischof #+# #+# */
/* Updated: 2016/01/21 15:16:25 by pfischof ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft.h"
static int issquare(const char *tab, int len)
{
int i;
int j;
int k;
j = 0;
k = 0;
while (tab[k] != '\0' && j++ < 26)
{
i = 0;
while (tab[k] != '\0' && i++ < 4)
{
k += 4;
if (tab[k] != '\n')
return (0);
k++;
}
if (tab[k] != '\n' && tab[k] != '\0')
return (0);
k++;
}
if ((k - 1) != len)
return (0);
return (1);
}
static int hasfour(const char *tab)
{
int i;
int j;
int k;
int n;
j = 0;
k = 0;
while (tab[k] != '\0' && j++ < 4)
{
i = 0;
n = 0;
while (tab[k] != '\0' && i++ < 21)
{
if (tab[k] == '#')
n++;
k++;
}
if (n != 4)
return (0);
}
return (1);
}
static int ischar(const char *tab)
{
int k;
k = 0;
while (tab[k] != '\0')
{
if (tab[k] != '\n' && tab[k] != '.' && tab[k] != '#')
return (0);
k++;
}
return (1);
}
static int doestouch(const char *tab)
{
int i;
int j;
int k;
int l;
k = 0;
l = 0;
while (tab[k] != '\0' && l < 26)
{
i = 0;
j = 0;
while (i++ < 21)
{
if (tab[k] == '#')
j += ft_howmany(tab, k, l);
k++;
}
if (j != 6 && j != 8)
return (0);
l++;
}
return (1);
}
int ft_isvalid(const char *tab, int len)
{
if (!issquare(tab, len) || !hasfour(tab) || !ischar(tab) || !doestouch(tab))
return (0);
return (1);
}