Solutions possibles aux exercices de boucles avec tableau

static int q1_trouverMax(int[] tabNombres)
{
    int max = tabNombres[0];

    for (int i = 1; i < tabNombres.Length; i++)
    {
        if (tabNombres[i] > max)
        {
            max = tabNombres[i];
        }
    }

    return max;
}

static int q2_trouverNbOccurenceLettre(char lettre, string mot)
{
    int nbOccurence = 0;

    for (int i = 0; i < mot.Length; i++)
    {
        if (mot[i] == lettre)
        {
            nbOccurence++;
        }
    }

    return nbOccurence;
}

static int q3_trouverPremiereLettre(char lettre, string mot)
{
    int position = 0;
    bool pasTrouve = true;

    while (position < mot.Length && pasTrouve)
    {
        if (mot[position] == lettre)
        {
            pasTrouve = false;
        }

        position++;
    }

    if (pasTrouve)
    {
        position = -1;
    }

    return position;
}

static void q4_afficherNbVraiEtFaut(bool[] tableau)
{
    int nbVrai = 0;
    int nbFaux = 0;

    for (int i = 0; i < tableau.Length; i++)
    {
        if (tableau[i])
        {
            nbVrai++;
        }
        else
        {
            nbFaux++;
        }
    }

    Console.WriteLine("NbVrai : {0}, NbFaux : {1}", nbVrai, nbFaux);
}

static void q5_afficherSequence(int[] tabZeroUn)
{
    int maxSequence = 0;
    int sequence = 0;

    for (int i = 0; i < tabZeroUn.Length; i++)
    {
        if (tabZeroUn[i] == 1)
        {
            sequence++;
            if (sequence > maxSequence)
            {
                maxSequence = sequence;
            }
        }
        else
        { 
            sequence = 0;
        }
    }

    for (int i = 0; i < maxSequence; i++)
    {
        Console.Write(1);
    }
}