Question

这是头文件代码stack.h：

#include <iostream>
using namespace std;
//template <class T> struct stackNode;
//template <class T>
struct stackNode {
int item;
stackNode *Next;
stackNode *Prev;
//stackNode *Temp;

};
class stackClass {
public:
stackClass();
stackClass(const stackClass &right);
~stackClass();
stackClass &operator=(const stackClass &right);
int counter;
int StackIsEmpty(void);
//stackNode *origptr;
void push( int item, bool &success);
int pop(void);

int GetStackTop(void);

protected:
stackNode *GetStackTopPtr(void);


private:

stackNode *Top;
stackNode *Current;
//stackNode *origptr;
//stackNode<T> *Next; 
};

这是实现文件stack.cpp：

#include "stack.h"

//constructor 
stackClass::stackClass(){
        Top = NULL;
        int counter = 0;
            }   

//copy constructor
stackClass::stackClass(const stackClass &right){
        if (right.Top == NULL){
        Top = NULL;
        counter = 0;
            }
        else {
            stackNode * origptr = right.GetStackTopPtr; 
        stackNode * currptr;
        Top = new stackNode; 
        currptr = Top;

        while(origptr->Next != NULL){
            currptr->item = origptr->item;
            origptr = origptr->Next;
            currptr->Next = new stackNode;
            currptr->Next->item = origptr->item;
            currptr = currptr-> Next;
            }
        currptr->Next = NULL;
            }   
    }

//Destructor
stackClass::~stackClass(){  
    while (Top != NULL){
        pop();
                    }               
            }
//push
void stackClass::push(int item, bool &success){
    success = false;
    if (Top == NULL){
        Top = new stackNode;
        Top -> item = item;
        Top -> Next = NULL;
        Top -> Prev = NULL;
        Current = Top; 
        counter++;
        success = true;
        }
    else {
        stackNode * Temp = new stackNode;
        Current -> Next = Temp;
        Temp -> Prev = Current;
        Temp -> Next = NULL; 
        Current = Temp;
        Current -> item = item;
        counter++;
        success = true;
        }

    }

int stackClass::pop(void){      

    if (Top == NULL){
        cout<<"Stack is empty"<<endl;
        }   

    else if (counter == 1){
        Top = NULL;
        delete Current; 
        counter--;
        }

    else if(counter > 1){
        Current -> Prev -> Next = NULL;
        Current = Current -> Prev;
        stackNode * Temp = Current -> Next;
        delete Temp; 
        counter--;              
        }   
    }   

int stackClass::StackIsEmpty(void){
    if (counter == 0)
        return 1;
    else 
        return 0;
    }

int stackClass::GetStackTop(void){

    int item = Top->item ; 
    return item;    
            }   

stackNode *stackClass::GetStackTopPtr(void){
    return Top;         
            }

这就是问题，

stack.cpp：在复制构造函数'stackClass :: stackClass（const stackClass＆amp;）'中： stack.cpp：19：31：错误：无法将'stackClass :: GetStackTopPtr'从类型'stackNode *（stackClass ::）（）'转换为'stackNode *'

我不知道为什么编译器会抱怨，看来在相关的行中，在stack.cpp中，第19行，right.GetStackTopPrt会返回一个stackNode *类型，它应该很好地分配给stackNode*在左侧。

如果您知道问题所在，请提供帮助。谢谢！

Answer 1

您正在尝试设置

stackNode * origptr = right.GetStackTopPtr;

其中左侧是stackNode指针，右侧是函数 GetStackTopPtr。我想你打算写：

stackNode * origptr = right.GetStackTopPtr(); // Note the parentheses!

请记住，编译器非常擅长计算类型，并且对这些事情几乎总是正确的。不要认为编译器是错的，找你先犯的错误！

由于类型不匹配，无法将一个指针指向另一个指针，或者编译器说

1 个答案: