graphs/piscine/hill_array/hill_array.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

#include "hill_array.h"

int top_of_the_hill(int tab[], size_t len)
{
    if (len == 0)
    {
        return -1;
    }

    int top = 0;
    size_t i = 0;

    while (i + 1 < len && tab[i] <= tab[i + 1])
    {
        if (tab[i] < 0 || tab[i + 1] < 0)
        {
            return -1;
        }
        if (tab[i] != tab[i + 1])
        {
            top = i + 1;
        }
        i++;
    }

    while (i + 1 < len && tab[i] >= tab[i + 1])
    {
        if (tab[i] < 0 || tab[i + 1] < 0)
        {
            return -1;
        }
        i++;
    }

    if (i + 1 == len)
    {
        return top;
    }
    else
    {
        return -1;
    }
}