整形单链表

本文主要是介绍整形单链表，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

IntSLLNode.h#ifndef INT_SINGLY_LINKED_LIST_NODE #define INT_SINGLY_LINKED_LIST_NODE #include <iostream> using namespace std; class IntSLLNode { public: // 无参，一个参，二个参都有构造函数。IntSLLNode(){info = 0;next = NULL; // 这是一个保险。啊}IntSLLNode(int i, IntSLLNode* in = 0){info = i;next = in; // 两个构造函数都将next置了0,太有用了}friend class IntSLList; // very important, solve the problem of using private in other class or global function.friend istream& operator>>(istream&, IntSLList&); friend ostream& operator<<(ostream&, const IntSLList&); private:int info;IntSLLNode* next; }; #endif 

IntSLList.h#ifndef INT_SINGLY_LINKED_LIST #define INT_SINGLY_LINKED_LIST #include "IntSLLNode.h" using namespace std; class IntSLList { public:IntSLList(); IntSLList(const int& n);IntSLList(istream &is); IntSLList(const IntSLList &object); ~IntSLList();bool isEmpty() const;bool addToHead(int);bool addtoTail(int);bool deleteNode(const int&);int deleteFromHead();int deleteFromTail();bool isInList(const int&) const;IntSLLNode* getHead() const;IntSLLNode* getTail() const;friend ostream& operator<<(ostream&, const IntSLList&);friend istream& operator>>(istream&, IntSLList&); private:IntSLLNode *head;IntSLLNode *tail; }; #endif 

IntSLList.cpp#include <iostream> #include "IntSLList.h" IntSLList::IntSLList() {head = NULL; // 指针一定要用空值来赋。tail = NULL; } IntSLList::IntSLList(istream &is) {

这篇关于整形单链表的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---