[002]链表笔记--编程实现一个单链表的创建/测长/打印

#include<iostream>

using namespace std;

class Link {
public:
Link() {}
Link *_pNext;
void Create();
void Output();
int GetElement();
private:
int _id;
int _cnt;
};

void Link::Create() {
cin >> this->_id;
}

void Link::Output() {
cout << this->_id;
}

int Link::GetElement() {
return this->_id;
}

int main() {
Link *pLink = new Link;
Link *pHead = pLink;
bool isfull = false;

while (!isfull) {
Link *data = new Link;
data->Create();
if (data->GetElement() != 0) {
data->_pNext = NULL;
pHead->_pNext = data;
pHead = pHead->_pNext;
}
else {
isfull = true;
}
}

pLink = pLink->_pNext;

while (pLink != 0) {
pLink->Output();
pLink = pLink->_pNext;
}

return 0;
}