C++实现推箱子功能附加回撤示例

跟着b站老师 做的，链接[c/c++]180行代码，推箱子就是这么简单~抄详细，学不会我还不信了，关卡切换和回退都实现了哦_哔哩哔哩_bilibili

编码环境：vs2019 

利用 链栈实现的回撤功能。

linkstack.h

#pragma once
/***链栈的实现***/
#ifdef _cplusplus
extern "c"
{
#endif
 
#include <fstream>
#include <iostream>
#include<stdbool.h>
using namespace std;
 
#define ok 1
#define error 0
#define overflow -2
//typedef int data;
 
struct point
{
    int r;
    int c;
    int data;
};
 
typedef struct _state
{
    point pos[3];
}data,state;
 
typedef struct stacknode
{
    data data;
    struct stacknode* next;
} stacknode, * linkstack;
 
//算法1　链栈的初始化(无头节点)
void initstack(linkstack& s)
{ // 构造一个空栈 s，栈顶指针置空
    s = null;
   // return ok;
}
 
//算法2　链栈的入栈
void push(linkstack& s, data e)
{ //在栈顶插入元素e
    linkstack p;
    p = new stacknode; //生成新结点
    p->data = e;       //将新结点数据域置为e
    p->next = s;       //将新结点插入栈顶（类似与前插法，只不过没有头节点）
    s = p;             //修改栈顶指针为p
    printf("ok\n");
    //return ok;
}
 
//算法3链栈的出栈
void pop(linkstack& s)
{ //删除s的栈顶元素，用e返回其值
    linkstack p;
    if (s == null)
        return ; //栈空
   // e = s->data;      //将栈顶元素赋给e
    p = s;            //用p临时保存栈顶元素空间，以备释放
    s = s->next;      //修改栈顶指针
    delete p;         //释放原栈顶元素的空间
   // return ok;
}
//算法4　取链栈的栈顶元素
data gettop(linkstack s)
{                       //返回s的栈顶元素，不修改栈顶指针
    if (s != null)      //栈非空
        return s->data; //返回栈顶元素的值，栈顶指针不变
}
 
bool empty(linkstack& s) {
    if (s == null)
        return true;
 
    else return false;
}
//
//void empty(linkstack& s) {
//
//}
 
#ifdef _cplusplus
}
#endif
/*
int main()
{
    linkstack s;
    int choose, flag = 0;
    selemtype j, t;
    cout << "1.初始化\n";
    cout << "2.入栈\n";
    cout << "3.读栈顶元素\n";
    cout << "4.出栈\n";
    cout << "0.退出\n\n";
    choose = -1;
    while (choose != 0)
    {
        cout << "请选择:";
        cin >> choose;
        switch (choose)
        {
        case 1: //算法q1　链栈的初始化
            if (initstack(s))
            {
                flag = 1;
                cout << "成功对栈进行初始化\n\n";
            }
            else
                cout << "初始化栈失败\n\n";
            break;
        case 2:
        { //算法2　链栈的入栈
            fstream file;
            file.open("/users/xiaokaixin/documents/code/cpp_code/txt_file/sqstack.txt");
            if (!file)
            {
                cout << "错误！未找到文件！\n\n"
                     << endl;
                exit(error);
            }
            if (flag)
            {
                flag = 1;
                cout << "进栈元素依次为：\n";
                while (!file.eof())
                {
                    file >> j;
                    if (file.fail())
                        break;
                    else
                    {
                        push(s, j);
                        cout << j << "  ";
                    }
                }
                cout << endl
                     << endl;
            }
            else
                cout << "栈未建立，请重新选择\n\n";
            file.close();
        }
        break;
        case 3: //算法3　取链栈的栈顶元素
            if (flag != -1 && flag != 0)
                cout << "栈顶元素为：\n"
                     << gettop(s) << endl
                     << endl;
            else
                cout << "栈中无元素，请重新选择\n"
                     << endl;
            break;
        case 4: //算法4　链栈的出栈
            if (flag)
            {
                cout << "依次弹出的栈顶元素为:\n";
                while (pop(s, t))
                    cout << t << "  ";
                cout << endl
                     << endl;
            }
            else
                cout << "栈未建立，请重新选择\n\n";
            break;
        }
    }
    return 0;
}
*/

cpp文件

#include<cstdlib>
#include<iostream>
#include<time.h>
#include<time.h>
#include<math.h>
#include<conio.h>
#include <windows.h>
#include<graphics.h>  //包含image数组
#include"linkstack.h"
 
using namespace std;
 
#define size 10
#define total_level 3
 
linkstack ls; //??
 
enum mine {
    space,
    wall,
    dest,
    box,
    player,
 
};
 
//linkstack* ls;
 
int x;
int y;
int level;
image all_image[6];
//空地0 墙1 目的地2 箱子3 玩家4 
//player+dest 5   box+dest:6
//a75  d77 72w 80s
 
int map[total_level][size][size] = {
    {
        {0,0,0,0,0,0,0,0,0,0},
        {0,0,0,1,1,1,0,0,0,0},
        {0,0,0,1,2,1,0,0,0,0},
        {0,0,0,1,3,1,1,1,1,0},
        {0,1,1,1,0,0,3,2,1,0},
        {0,1,2,3,4,0,1,1,1,0},
        {0,1,1,1,1,3,1,0,0,0},
        {0,0,0,0,1,2,1,0,0,0},
        {0,0,0,0,1,1,1,0,0,0},
        {0,0,0,0,0,0,0,0,0,0}
    },
    {
        {0,0,0,0,0,0,0,0,0,0},
        {0,0,1,1,1,1,1,1,0,0},
        {0,0,1,0,2,0,0,1,0,0},
        {0,0,1,0,0,3,0,1,0,0},
        {0,0,1,0,0,0,0,1,0,0},
        {0,0,1,0,0,4,0,1,0,0},
        {0,0,1,1,1,1,1,1,0,0},
        {0,0,0,0,0,0,0,0,0,0},
        {0,0,0,0,0,0,0,0,0,0},
        {0,0,0,0,0,0,0,0,0,0}
    },
    {
        {0,0,0,0,0,0,0,0,0,0},
        {0,1,1,1,0,0,0,0,0,0},
        {0,1,2,1,0,0,0,0,0,0},
        {0,1,3,1,0,0,0,0,0,0},
        {0,1,4,1,0,0,0,0,0,0},
        {0,1,1,1,0,0,0,0,0,0},
        {0,0,0,0,0,0,0,0,0,0},
        {0,0,0,0,0,0,0,0,0,0},
        {0,0,0,0,0,0,0,0,0,0},
        {0,0,0,0,0,0,0,0,0,0}
    }
 
};
 
void loadimg()
{
 
    for (int i = 0; i < 6; i++)
    {
        char file[20] = "";
        sprintf(file, "./image/%d.bmp", i);
        loadimage(all_image + i, file, 64, 64);//image *pdstimg(// 保存图像的 image 对象指针), 
        //e.g.loadimage(all_image + i,"0.bmp",64,64); //lpctstr pimgfile,图片文件名
                                             //int nwidth = 0, int nheight = 0, bool bresize = false);					
        //putimage(i*64,0,all_image + i); //坐标原点为左上角。注意x，y坐标
 
    }
 
}
 
void upmove() {
    if (map[level][x - 1][y] == space || map[level][x - 1][y] == dest) {
        map[level][x - 1][y] += player;
        map[level][x][y] -= player;
    }
    else if (map[level][x - 1][y] == box || map[level][x - 1][y] == box + dest) {
        if (map[level][x - 2][y] == space || map[level][x - 2][y] == dest) {
            map[level][x - 2][y] += box;
            map[level][x - 1][y] = map[level][x - 1][y] + player - box;
            map[level][x][y] -= player;
        }
 
    }
 
}
 
void downmove() {
    if (map[level][x + 1][y] == space || map[level][x + 1][y] == dest) {
        map[level][x + 1][y] += player;
        map[level][x][y] -= player;
    }
    else if (map[level][x + 1][y] == box || map[level][x + 1][y] == box + dest) {
        if (map[level][x + 2][y] == space || map[level][x + 2][y] == dest) {
            map[level][x + 2][y] += box;
            map[level][x + 1][y] = map[level][x + 1][y] + player - box;
            map[level][x][y] -= player;
        }
 
    }
 
}
 
void leftmove() {
    if (map[level][x][y - 1] == space || map[level][x][y - 1] == dest) {
        map[level][x][y - 1] += player;
        map[level][x][y] -= player;
    }
    else if (map[level][x][y - 1] == box || map[level][x][y - 1] == box + dest) {
        if (map[level][x][y - 2] == space || map[level][x][y - 2] == dest) {
            map[level][x][y - 2] += box;
            map[level][x][y - 1] = map[level][x][y - 1] + player - box;
            map[level][x][y] -= player;
        }
 
    }
 
}
 
void rightmove() {
    if (map[level][x][y + 1] == space || map[level][x][y + 1] == dest) {
        map[level][x][y + 1] += player;
        map[level][x][y] -= player;
    }
    else if (map[level][x][y + 1] == box || map[level][x][y + 1] == box + dest) {
        if (map[level][x][y + 2] == space || map[level][x][y + 2] == dest) {
            map[level][x][y + 2] += box;
            map[level][x][y + 1] = map[level][x][y + 1] + player - box;
            map[level][x][y] -= player;
        }
 
    }
 
}
 
void gamedraw() {
    for (int i = 0; i < size; i++)
    {
        for (int j = 0; j < size; j++)
        {
            switch (map[level][i][j])
            {
            case space:
                putimage(j * 64, i * 64, all_image);
                break;
            case wall:
                putimage(j * 64, i * 64, all_image + 1);
                break;
            case dest:
                putimage(j * 64, i * 64, all_image + 2);
                break;
            case box:
                putimage(j * 64, i * 64, all_image + 3);
                break;
            case player:
                x = i;
                y = j;
                putimage(j * 64, i * 64, all_image + 4);
                break;
            case player + dest:
                putimage(j * 64, i * 64, all_image + 4);
                x = i;
                y = j;
                break;
            case box + dest:
                putimage(j * 64, i * 64, all_image + 5);
                break;
            default:
                break;
            }
 
        }
        cout << endl;
 
    }
 
}
 
//对应的asc码值
//w w:119,87  dd:100,68 ww:119,87 ss:115,83 空格:32
void savestate(int x, int y, int dir) {//player的坐标，以及keyevent
    //state t;
    state t;
    memset(&t, 0, sizeof(state));
    switch (dir)
    {
    case 119://w
    case 87:
        for (int i = 0; i < 3; i++)
        {
            t.pos[i].r = x - i;  //依次记录 player 、player的下一格、以及player的下下一格 的行列坐标以及data
            t.pos[i].c = y;
            t.pos[i].data = map[level][t.pos[i].r][t.pos[i].c];
 
        }
        push(ls, t);
        break;
    case 115://s
    case 83:
        for (int i = 0; i < 3; i++)
        {
            t.pos[i].r = x + i;  //依次记录 player 、player的下一格、以及player的下下一格 的行列坐标以及data
            t.pos[i].c = y;
            t.pos[i].data = map[level][t.pos[i].r][t.pos[i].c];
 
        }
        push(ls, t);
        data p = gettop(ls);
        break;
 
    case 97://a
    case 65:
        for (int i = 0; i < 3; i++)
        {
            t.pos[i].r = x;  //依次记录 player 、player的下一格、以及player的下下一格 的行列坐标以及data
            t.pos[i].c = y - i;
            t.pos[i].data = map[level][t.pos[i].r][t.pos[i].c];
        }
        push(ls, t);
        break;
 
    case 100://d
    case 68:
        for (int i = 0; i < 3; i++)
        {
            t.pos[i].r = x;  //依次记录 player 、player的下一格、以及player的下下一格 的行列坐标以及data
            t.pos[i].c = y + i;
            t.pos[i].data = map[level][t.pos[i].r][t.pos[i].c];
 
        }
        push(ls, t);
        break;
    default:
        break;
    }
    
}
 
void rollback() {
    if (empty(ls))
    {
        return;
    }
    state t = gettop(ls);
    for (int i = 0; i < 3; i++)
    {
        map[level][t.pos[i].r][t.pos[i].c] = t.pos[i].data;
    }
    pop(ls);
}
 
void keyevent() {
    char event = _getch();
    if (event != 32  && event != -32) {
        savestate(x, y, event);
    }
    switch (event)
    {
    case 'w':
    case 'w':
        upmove();
        break;
 
    case 's':
    case 's':
        downmove();
        break;
 
    case 'a':
    case 'a':
        leftmove();
        break;
    case 'd':
    case 'd':
        rightmove();
        break;
    case 32:
        rollback();
        break;
    default:
        break;
    }
 
 
}
 
bool judge_pass() {
    for (int i = 0; i < size; i++)
    {
        for (int j = 0; j < size; j++)
        {
            if (map[level][i][j] == box)
            {
                return false;
            }
 
        }
 
    }
 
    return true;
}
 
int main() {
    initstack(ls);
    initgraph(size * 64, size * 64, true);
    loadimg();
    //system("mode con lines=20 cols=25");
    level = 0;
    while (level < total_level)
    {
        //system("cls");
        gamedraw();
        keyevent();
 
        if (judge_pass())
        {
            if (level == total_level - 1) {
                //system("cls");
                gamedraw();
            }
            level++;
            while (!empty(ls))
            {
                pop(ls);
            }
 
        }
 
    }
 
    messagebox(null, text("congratulations!"), text("game over"), mb_ok);
 
    // getchar();
 
 
    return 0;
}

附文件结构 

到此这篇关于c+++实现推箱子功能附加回撤示例的文章就介绍到这了,更多相关c+++ 推箱子内容请搜索以前的文章或继续浏览下面的相关文章希望大家以后多多支持！