c++贪吃蛇源码(13)

简单的贪吃蛇代码

snake.tail=p;

snake.length++;

}

Node Dequeue()

{

Node *p=snake.head;

Node outNode=*p;

snake.head=p->next;

snake.length--;

delete p;

return outNode;

}

int Hit(int x,int y)

{

if(x<frame.left||x>=frame.right||y<frame.top||y>=frame.bottom)//hit the wall

return 1;

Node *p=snake.head->next;

for(int i=snake.length-1;i>3;i--,p=p->next)//hit itself if(x==p->x&&y==p->y)