面向对象的链表

描述

已知顺序表L递增有序，编写一个算法，将X插入到线性表的适当位置上，以保持线性表的有序性！

样例输入

5
12 23 34 45 56
30

样例输出

12 23 30 34 45 56 

 

以前链表的写法都是面向过程的，而面向对象的写法使得程序更具简洁性，当然，更重要的是OOP的思想

//: 在顺序表中插入元素
#include <iostream>

using namespace std;

class MyClass {
public:
  struct Link {
    int   data;
    Link* next;
  }*head, *tail;
  
  MyClass();
  
  void push(const int&);
  void insert_value(const int&);
  void print_list();
  void cleanUp();
};

MyClass::MyClass() {
  head = tail = NULL;
}

void MyClass::push(const int& dat) {
  Link* ptr = new Link;
  ptr->data = dat;
  ptr->next = NULL;
  if (head == NULL) {
    head = tail = ptr;
  }
  else {
    tail->next = ptr;
    tail = ptr;
  }
  return ;
}

void MyClass::insert_value(const int& dat) {
  Link* front = NULL;
  Link* back  = head;
  bool  isInserted = false;
  
  while (isInserted == false) {
    if (back->data >= dat) {
      Link* newNode = new Link;
      newNode->data = dat;
      newNode->next = back;
      if (front == NULL)
        head = newNode;
      else
        front->next = newNode;

      isInserted = true;
    }
    front = back;
    back  = back->next;
  }// End of While
  return ;
}

void MyClass::print_list() {
  bool  isSpace = false;
  Link* ptr = head;
  while (ptr != NULL) {
    if (isSpace) {
      cout << ' ' << ptr->data;
    }
    else {
      isSpace = true;
      cout << ptr->data;
    }
    ptr = ptr->next;
  }// End of While
  cout << endl;
  return ;
}

void MyClass::cleanUp() {
  while (head != NULL) {
    Link* oldHead = head;
    head = head->next;
    delete oldHead;
  }// End of While
}

int main() {
  int listLen, dat;
  
  while (cin >> listLen) {
    MyClass solver;
    for (int i = 0; i < listLen; ++i) {
      cin >> dat;
      solver.push(dat);
    }
    
    cin >> dat;
    solver.insert_value(dat);
    solver.print_list();
    solver.cleanUp();
  }// End of While
  return 0;
} ///:~