Форум программистов [Powered by Invision Power Board]

Код


// linklist.cpp
// linked list
#include <iostream>
using namespace std;
////////////////////////////////////////////////////////////////
struct link                           //one element of list
   {
   int data;                          //data item
   link* next;                        //pointer to next link
   };
////////////////////////////////////////////////////////////////
class linklist                        //a list of links
   {
   private:
      link* first;                    //pointer to first link
   public:
      linklist()                      //no-argument constructor
         { first = NULL; }            //no first link
      void additem(int d);            //add data item (one link)
      void display();                 //display all links
   };
//--------------------------------------------------------------
void linklist::additem(int d)         //add data item
   {
   link* newlink = new link;          //make a new link
   newlink->data = d;                 //give it data
   newlink->next = first;             //it points to next link
   first = newlink;                   //now first points to this
   }
//--------------------------------------------------------------
void linklist::display()              //display all links
   {
   link* current = first;             //set ptr to first link
   while( current != NULL )           //quit on last link
      {
      cout << current->data << endl;  //print data
      current = current->next;        //move to next link
      }
   }
////////////////////////////////////////////////////////////////
int main()
   {
   linklist li;       //make linked list

   li.additem(25);    //add four items to list
   li.additem(36);
   li.additem(49);
   li.additem(64);

   li.display();      //display entire list
   return 0;
   }

Код


class linklist                        // a list of links
{
       private:
       // .......
       link *first, *last;
       public:
       linklist() : first(0), last(0) {}
       void insertAtBack(int);                      
       // .....
};

Код


void linklist::insertAtBack(int d)         // add data item
{
        list *newNode = new link;         // make a new link
        newNode->data = d;                 // give it data
  
        if(first == 0)                               // list is empty?
              first = last = newNode;
        else
        {
              last->next = newNode;    
              last = neNode;
         }
}

Цитата(Hawaii @ 24.7.2007, 18:47

)

чтобы она добавляла новый элемент в конец связного списка, а не в начало, как здесь.

Код


void linklist::insertAtBack(int d)         // add data item
{
        list *newNode = new link;         // make a new link
        newNode->data = d;                 // give it data
  
        if(first == 0)                               // list is empty?
              first = last = newNode;
        else
        {
              last->next = newNode;    
              last = neNode;
         }

}

Код


void linklist::insertAtBack(int d)         // add data item
{
        link* newNode = new link;         // make a new link
        newNode->data = d;                 // give it data
  
        if(first == 0)                               // list is empty?
              first = last = newNode;
        else
        {
              last->next = newNode;    
              newNode->next = NULL;
        }

}

Код


void linklist::additem(int d)         // add data item
{
        link* newNode = new link;         // make a new link
        newNode->data = d;                 // give it data
  
        if(first == 0)                               // list is empty?
        {
              first = last = newNode;
              newNode->next = NULL;
        }
        else
        {
              last->next = newNode;    
              newNode->next = NULL;
              last = newNode;  
        }
}