A* obj=new C(); obj->fun(); class C:public B { private: virtual fun()

// tmpDerive.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
class A
{
public:
	virtual fun()
	{
		printf("A!\n");
	}
};
class B:public A
{
protected:
	virtual fun()
	{
		printf("B!\n");
	}
};

class C:public B
{
private:
	virtual fun()
	{
		printf("C!\n");
	}
};

class A1
{
private:
	virtual fun()
	{
		printf("A1!\n");
	}
};
class B1:public A1
{
protected:
	virtual fun()
	{
		printf("B1!\n");
	}
};

class C1:public B1
{
public:
	virtual fun()
	{
		printf("C1!\n");
	}
};
int main(int argc, char* argv[])
{
	A* obj=new C();
	obj->fun();
	C1* pobjC1=new C1();
	A1* obj1=pobjC1;
	printf("%p;%p\n",pobjC1,obj1);
	reinterpret_cast<C1*>(obj1)->fun();
	static_cast<C1*>(obj1)->fun();
	//obj1->fun();

	printf("Hello World!\n");
	return 0;
}

typedef struct { int *base; int front; int rear; int num,size; } MyCircularQueue; MyCircularQueue* myCircularQueueCreate(int k) { MyCircularQueue *obj=(MyCircularQueue*)malloc(sizeof(MyCircularQueue)); if(!obj) return NULL; obj->base=(int*)malloc(k*sizeof(int)); obj->front=obj->rear=0; obj->num=0; obj->size=k; return obj; } bool myCircularQueueIsEmpty(MyCircularQueue* obj); bool myCircularQueueIsFull(MyCircularQueue* obj); bool myCircularQueueEnQueue(MyCircularQueue* obj, int value) { if(myCircularQueueIsFull(obj)) return false; obj->rear=(obj->rear+1)%obj->size; obj->base[obj->rear]=value; obj->num++; if(obj->num==1) obj->front=obj->rear; return true; } bool myCircularQueueDeQueue(MyCircularQueue* obj) { if(myCircularQueueIsEmpty(obj)) return false; obj->base[obj->front]=-1; obj->front=(obj->front+1)%obj->size; obj->num--; return true; } int myCircularQueueFront(MyCircularQueue* obj) { if(myCircularQueueIsEmpty(obj)) return -1; else return obj->base[obj->front]; } int myCircularQueueRear(MyCircularQueue* obj) { if(myCircularQueueIsEmpty(obj)) return -1; else return obj->base[obj->rear]; } bool myCircularQueueIsEmpty(MyCircularQueue* obj) { return(obj->num==0); } bool myCircularQueueIsFull(MyCircularQueue* obj) { return(obj->num==obj->size); } void myCircularQueueFree(MyCircularQueue* obj) { free(obj->base); obj->base=NULL; free(obj); obj=NULL; } /** * Your MyCircularQueue struct will be instantiated and called as such: * MyCircularQueue* obj = myCircularQueueCreate(k); * bool param_1 = myCircularQueueEnQueue(obj, value); * bool param_2 = myCircularQueueDeQueue(obj); * int param_3 = myCircularQueueFront(obj); * int param_4 = myCircularQueueRear(obj); * bool param_5 = myCircularQueueIsEmpty(obj); * bool param_6 = myCircularQueueIsFull(obj); * myCircularQueueFree(obj); */
最新发布
07-13
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值