碰到access violation

[myh0305]

#include <iostream.h>

typedef struct
{
int* array;
int sp;
int size;
}StackStruct;

class Queue {
public:
void Init(StackStruct *s, int size);
void cleanUp();
int isEmpty(StackStruct *s);
int isFull(StackStruct *s);
void push(int item);
int pop(StackStruct *s);

public:
StackStruct *s;
};

void Queue::Init(StackStruct *s, int size)
{
s->array = new int[size];
s->size = size;
s->sp = 0;
}

void Queue::cleanUp()
{
delete s->array;
}

int Queue::isEmpty(StackStruct *s)
{
return s->sp == 0 ? 1 : 0;
}

int Queue::isFull(StackStruct *s)
{
return s->sp == s->size ? 1 : 0;
}

void Queue::push(int item)
{
if(!isFull(s)) s->array[s->sp++] = item;
}

int Queue::pop(StackStruct *s)
{
if(isEmpty(s))
return 0;
else
return s->array[--s->sp];
}

void main()
{
Queue queue;
StackStruct *stack =queue.s;
queue.Init(stack, 15);

for(int i=0; i < 25; i++)
queue.push(i);
while(!queue.isEmpty(stack))
cout<<queue.pop(stack)<<" ";
cout<<endl;
}

执行到s->array = new int[size];语句时出错,为access violation
请高手指点.

[wugu111]

我喜欢一楼
呵呵

[myh0305]

高手帮忙看一下 啊!

[beyondtkl]

StackStruct *s;

先　s = new StackStruct...

Queue queue; 你這個queue.s　沒有分配空間呀。。。是傳說重的野指針。。。。

[021850524]

Queue queue;这句中的queue没有构造齐吧.queue.s还没有分配空间呢你就使用它了.

[liem]

void Queue::Init(StackStruct *s, int size)
{
s->array = new int[size];
s->size = size;
s->sp = 0;
}
1)由于StackStruct *s是Queue的成员，因此不必作为Queue::Init的参数，其它成员函数也是如此
2)Queue没有定义构造函数，因此将调用默认的构造函数，而在默认的构造函数中，没有为StackStruct *s分配空间，因此需要在Init中为s分配空间


void Queue::Init(int size)
{
s=new StackStruct;
s->array = new int[size];
s->size = size;
s->sp = 0;
}

[kissinger2000]

#include <iostream.h>

typedef struct
{
int* array;
int sp;
int size;
}StackStruct;

class Queue {
public:
void Init( int size);
void cleanUp();
int isEmpty();
int isFull();
void push(int item);
int pop();

public:
StackStruct *s;
};

void Queue::Init( int size)
{
s = new StackStruct;
s->array = new int[size];
s->size = size;
s->sp = 0;
}

void Queue::cleanUp()
{
delete s->array;
}

int Queue::isEmpty()
{
return s->sp == 0 ? 1 : 0;
}

int Queue::isFull()
{
return s->sp == s->size ? 1 : 0;
}

void Queue::push(int item)
{
if(!isFull()) s->array[s->sp++] = item;
}

int Queue::pop()
{
if(isEmpty())
return 0;
else
return s->array[--s->sp];
}

void main()
{
Queue queue;
//StackStruct *stack =queue.s;
queue.Init( 15);

for(int i=0; i < 25; i++)
queue.push(i);
while(!queue.isEmpty())
cout<<queue.pop()<<" ";
cout<<endl;
}

[myh0305]

谢谢上的各位!