Пример #1
0
 public void StergereFinal()
 {
     Nod[] s = new Nod[n - 1];
     for (int i = 0; i < n - 1; i++)
     {
         s[i] = v[i];
     }
     n--;
     v = new Nod[n];
     for (int i = 0; i < n; i++)
     {
         v[i] = s[i];
     }
 }
Пример #2
0
 public void StergereInceput()
 {
     Nod[] s = new Nod[n - 1];
     for (int i = 1; i < n; i++)
     {
         s[i - 1] = v[i];
     }
     n--;
     v = new Nod[n];
     for (int i = 0; i < n; i++)
     {
         v[i] = s[i];
     }
 }
Пример #3
0
 public void AdaugFinal(Nod x)
 {
     Nod[] s = new Nod[n];
     for (int i = 0; i < n; i++)
     {
         s[i] = v[i];
     }
     n++;
     v = new Nod[n];
     for (int i = 0; i < n - 1; i++)
     {
         v[i] = s[i];
     }
     v[n - 1] = x;
 }
Пример #4
0
 public void AdaugInceput(Nod x)
 {
     Nod[] s = new Nod[n];
     for (int i = 0; i < n; i++)
     {
         s[i] = v[i];
     }
     n++;
     v = new Nod[n];
     for (int i = 1; i < n; i++)
     {
         v[i] = s[i - 1];
     }
     v[0] = x;
 }