這里提示錯(cuò)誤的類型，后面demo測(cè)試通過，但輸出結(jié)果不對(duì)。感覺person這個(gè)類沒有被調(diào)用成功。請(qǐng)高手指點(diǎn)一下啊。附上敲的代碼：person.cpp

#include"Person.h"

Person &Person::operator=(Person &person)

{

this->name = person.name;

this->phone = person.phone;

return *this;

}

bool Person::operator==(Person &person)

{

if (this->name == person.name && this->phone == person.phone)

{

return true;

}

return false;

}

ostream &operator<<(ostream &out, Person &person)

{

out << person.name << "------" << person.phone << endl;

return out;

}

person.h

#ifndef PERSON_H

#define PERSON_H

#include <ostream>

#include<string>

using namespace std;

class Person

{

friend ostream &operator<<(ostream &out, Person &person);

public:

string name;

string phone;

Person &operator=(Person &person);

bool operator == (Person &person);

};

#endif

Node.cpp

#include"Node.h"

#include <iostream>

using namespace std;

void Node::printNode()

{

cout << data << endl;//輸出重載，輸出重載應(yīng)用友元全局函數(shù)

}

Node.h

#ifndef COORDINATE_H

#define COORDINATE_H

#include"Person.h"

using namespace std;

class Node

{

public:

Person data;

Node *next;

void printNode();

};

#endif

demo.cpp

int main(void)

{?

??

Node node1;

node1.data.name = "tester1";

node1.data.phone = "12345";

Node node2;

node2.data.name = "tester2";

node2.data.phone = "234567";

List* pList = new List();

pList->ListInsertTail(&node1);

pList->ListInsertTail(&node2);

pList->ListTraverse();

delete pList;

pList = NULL;

system("pause");

return 0;