2018. március 9., péntek

2018.03.09. Programozás gyakorlás - Helyjegy - egymásba ágyazott ciklus


        static void _6.fel_hanyHelyen()
        {
            int j;
            bool kilep;
            megallok = new double[hossz];
            for (int i = 0; i < megallok.Length; i++)
            {
                megallok[i] = -1;
            }
            megallok[0]=felszall[0];

            for (int i = 1; i < felszall.Length; i++)
            {
                j = 0;
                kilep = false;
                while (j < megallok.Length && !kilep)
                {
                    if ( megallok[j] == felszall[i])
                    {
                        kilep=true;
                    }
                    else if (megallok[j]==-1)
                    {
                        megallok[j] = felszall[i];
                        kilep=true;
                    }                  
                    j++;
                }

                j = 0;
                kilep = false;
                while (j < megallok.Length && !kilep)
                {
                    if (megallok[j] == leszall[i])
                    {
                        kilep = true;
                    }
                    else if (megallok[j] == -1)
                    {
                        megallok[j] = leszall[i];
                        kilep = true;
                    }
                    j++;
                }
            }
            //Ezt megjegyzésbe kell tenni:
            Array.Sort(megallok);
            j = 0;
            while (j < megallok.Length)
            {
                if (megallok[j] != -1)
                    Console.WriteLine(megallok[j]);
                j++;
            }
        }