迷宫

最新推荐文章于 2020-06-19 21:34:08 发布
最新推荐文章于 2020-06-19 21:34:08 发布
阅读量904 收藏
点赞数
分类专栏： 蓝桥杯 文章标签： 递归 递归法 迷宫
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/liumingm_music/article/details/39504415
版权 
package com.liu.exam02;
/**
 * 迷宫问题
 *
 */
public class Maze {
	
	//自己定义一个迷宫
	public static String Maze[][]={
		{"▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇"},
		{"▇","▁","▁","▁","▇","▁","▁","▁","▁","▁","▁","▁","▁","▇","▇","▇","▇"},
		{"▇","▇","▇","▁","▇","▇","▁","▇","▁","▇","▇","▇","▁","▇","▁","▁","▇"},
		{"▇","▁","▇","▁","▇","▁","▁","▇","▁","▇","▁","▇","▁","▇","▁","▇","▇"},
		{"▇","▁","▇","▁","▇","▇","▁","▇","▁","▇","▁","▇","▁","▇","▁","▇","▇"},
		{"▇","▁","▁","▁","▁","▁","▁","▇","▁","▇","▁","▇","▁","▇","▁","▇","▇"},
		{"▇","▇","▇","▁","▇","▇","▁","▇","▁","▇","▁","▇","▁","▇","▁","▇","▇"},
		{"▇","▁","▁","▇","▁","▇","▁","▇","▁","▇","▁","▁","▁","▇","▁","▇","▇"},
		{"▇","▁","▇","▁","▁","▁","▁","▁","▁","▁","▇","▇","▇","▇","▁","▇","▇"},
		{"▇","▁","▇","▇","▇","▇","▇","▁","▇","▇","▇","▇","▁","▁","▁","▇","▇"},
		{"▇","▁","▇","▁","▁","▁","▁","▁","▇","▁","▁","▁","▁","▇","▁","▁","▇"},
		{"▇","▁","▇","▁","▇","▇","▇","▁","▇","▁","▇","▁","▇","▇","▇","▁","▇"},
		{"▇","▁","▇","▁","▇","▁","▁","▁","▇","▁","▇","▁","▁","▇","▇","▁","▇"},
		{"▇","▁","▇","▁","▇","▇","▇","▇","▇","▁","▇","▇","▁","▇","▇","▁","▇"},
		{"▇","▁","▇","▁","▇","▁","▁","▁","▁","▁","▇","▇","▁","▇","▇","▁","▇"},
		{"▇","▁","▇","▁","▇","▁","▇","▁","▇","▇","▁","▇","▁","▇","▁","▁","▇"},
		{"▇","▁","▇","▁","▇","▁","▇","▁","▇","▁","▁","▇","▁","▇","▇","▇","▇"},
		{"▇","▁","▇","▁","▇","▁","▇","▁","▇","▁","▇","▇","▁","▁","▁","▁","▇"},
		{"▇","▁","▁","▁","▇","▁","▇","▁","▇","▁","▇","▇","▁","▇","▇","▁","▇"},
		{"▇","▇","▇","▁","▇","▇","▇","▁","▇","▁","▇","▇","▁","▇","▇","▁","▇"},
		{"▇","▁","▇","▁","▁","▁","▁","▁","▇","▁","▇","▇","▁","▇","▇","▁","▇"},
		{"▇","▁","▁","▁","▇","▇","▇","▇","▇","▁","▁","▁","▁","▁","▇","▁","▇"},
		{"▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇","▇"},
	};
	
	
	public static void main(String[] args) {

		System.out.println("迷宫的起点是=(1,1):");
		System.out.println("迷宫的终点是=(22,15):");
		System.out.println("迷宫图形");
		System.out.println("---------------------------------------");
		for (int i = 0; i < 23; i++) {
			for (int j = 0; j < 17; j++) {
				System.out.printf("%4s",Maze[i][j]);
			}
			System.out.println();
		}
		System.out.println("---------------------------------------");
		System.out.println("调用函数：Way");
		Way(1, 1);
		Maze[1][1]="起";
		Maze[21][15]="终";
		System.out.println("---------------------------------------");
		for (int i = 0; i < 23; i++) {
			for (int j = 0; j < 17; j++) {
				System.out.printf("%4s",Maze[i][j]);
			}
			System.out.println();
		}
		System.out.println("---------------------------------------");
		System.out.println("其中  ╋  为走出迷宫的路线");
		System.out.println("其中  ○  为走过的路线，但是没有走出去");
		
	}//main
	public static boolean Way(int x,int y){
		if(Maze[21][15]=="╋"){
			return true;
		}else if(Maze[x][y]=="▁"){
			Maze[x][y]="╋";
			if(Way(x,y+1)){
				return true;
			}else if(Way(x,y-1)){
				return true;
			}else if(Way(x-1,y)){
				return true;
			}else if(Way(x+1,y)){
				return true;
			}else{
				Maze[x][y]="○";//走过，但是没有走出去
				return false;
			}
		}else{
			return false;
		}
	}
	
}

 

我有一个小毛驴
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
python算法实现走迷宫,画出路线
05-31
python算法实现走迷宫,用图形表示，走法路线可画出来！
迷宫最短路径
笃笃前行的专栏
10-13 360
Description 为了测试某种药物对小白鼠方向感的影响，生物学家在实验室做了一个矩形迷宫，入口和出口都确定为唯一的，且分布在矩形的不同边上。现在让你算出小白鼠最短需要走多少步，才可以从入口走到出口。 Input 共N+1行，第一行为N（N=0表示输入结束），以下N行N列0-1矩阵，1表示不能通过，0表示可以通过（左上角和右下角为0，即入口和出口），其中N。 O
【SSL_P2278】 Oliver的救援
你...你不要过来啊！！！
12-21 172
Oliver的救援 题目链接：Oliver的救援 题目描述 在你的帮助下，Oliver终于追到小X了，可有一天，坏人把小X抓走了。这正是Oliver英雄救美的时候。所以，Oliver又找到哆啦A梦，借了一个机器，机器显示出一幅方格地图，它告诉Oliver哪里能走，哪里不能走,。并且Oliver在这个地图的右下角，而小X在左上角。时间紧急，Oliver想知道，最少要走多少个格子,才能找到小X。（只...
算法：Python递归实现走迷宫
叶赫那拉坤的博客
12-07 1万+
什么是递归?简单地理解就是函数调用自身的过程就称之为递归。 什么时候用到递归？如果一个问题可以表示为更小规模的迭代运算，就可以使用递归算法。 迷宫问题：一个由0或1构成的二维数组中，假设1是可以移动到的点，0是不能移动到的点，如何从数组中间一个值为1的点出发，每一只能朝上下左右四个方向移动一个单位，当移动到二维数组的边缘，即可得到问题的解，类似的问题都可以称为迷宫问题。 在python中可以使用l
01迷宫（BFS+记忆)
热门推荐
Veggie的博客
05-31 1万+
题目描述 有一个仅由数字 0 与 1 组成的 n × n 格迷宫。若你位于一格 0 上，那么你可以移动到相邻 4 格中的某一格 1 上，同样若你位于一格 1 上，那么你可以移动到相邻 4 格中的某一格 0 上。 你的任务是：对于给定的迷宫，询问从某一格开始能移动到多少个格子（包含自身）。 输入 输入的第 1 行为两个正整数 n，m （n ≤ 1000，m ≤ 100000） 下面 n...
迷宫问题
01-06
//迷宫 int m,n;//m:出口层数 n:入口 int tag;//为输出做标记 int DFS(int k)//深度搜索第k层，k:当前路口 { int i,j; if(k==m)//到达出口 { tag=1; return 0; } for(i=0;i>n; if(0==n)break; int i,j; ...
迷宫_迷宫_
09-29
在本项目中，我们探索了如何设计和实现一个迷宫问题的解决方案，其核心目标是找到从特定起点到终点的有效路径。迷宫问题是一个经典的计算机科学问题，涉及到图论、搜索算法以及路径规划等多个领域。这里我们将深入...
Oliver的救援
QWQ5457的博客
01-06 422
2018年第一次信息赛——t4：Oliver的救援！ 题目描述：在你的帮助下，Oliver终于追到小X了，可有一天，坏人把小X抓走了。这正是Oliver英雄救美的时候。所以，Oliver又找到哆啦A梦，借了一个机器，机器显示出一幅方格地图，它告诉Oliver哪里能走，哪里不能走,。并且Oliver在这个地图的右下角，而小X在左上角。时间紧急，Oliver想知道，最少要走多少个格子,才能找到小X。
01迷宫
HT008的Blog
02-06 468
#include <cstdio> #include <iostream> #include <cstring> #include <string> #include <algorithm> using namespace std; int n,m; char map[1002][1002]; int dx[5]={0,1,-1,0,0},dy[5]={0,0,0,1,-1}; int f[1002
Python 制作迷宫游戏（一）——地图
安陵的博客
06-19 6142
Python 制作迷宫游戏（一）——地图 序 作为一个迷宫类的游戏，其最重要的是什么？当然是它的地图啦♪(^∇^*) 那么我们又该如何制作一张迷宫地图呢⊙(・◇・)？ 很显然，我们不可能一张张自己画吧 网络上常见的迷宫算法有三种 深度优先 随机prim 和递归分割 在我看来，prime算法是最适合制作迷宫地图的算法，由它制作出来的地图，相对而言更加自然， 也不会有未利用的大块空闲面积。这里推荐两位大佬的博客 [三大迷宫算法](https://blog.csdn.net/juzihongle1/article
python import 迷宫
FBeetle的博客
01-04 882
import 迷宫 问题 cleven 回覆至 python-cn@googlegroups.com 收件人 python-cn@googlegroups.com 日期 2008年11月25日 下午 12:01 主旨 [CPyUG:72341] import嵌套的问题 看了《Python源码剖析》，里面提到的嵌套import的问题
通过Python代码实现走迷宫的方法
jetmie的博客
02-04 1万+
#用来判断坐标是否合法 def check_valid(mg, x, y): if x >= 0 and x = 0 and y < len(mg[0]) \ and mg[x][y] == 1: return True else: return False #迷宫结果优化 def process(step): #
贪心算法1（python）
wuzhouqingcy的博客
08-29 1918
贪心法就是遵循某种规则，不断贪心地选取当前最优策略的算法设计方法。 V=[1,5,10,50,100,500]#钱的面值 #C=[3,2,1,3,0,2]#对应钱的数量，1元的3个；5元的2个；10元的1个；依次类推 C=[300,200,100,300,100,200]# A=640 def solve(A): print(A) ans=0 for i in rang
python数据结构学习笔记-2017-01-08-01-N皇后问题、迷宫问题和跳马问题的递归解决
mengzm的博客
01-08 1590
N皇后问题         棋盘ADT #-*-coding: utf-8-*- # 二维数组实现棋盘ADT from myarray2d import Array2D class Board(object): def __init__(self, n): self._board = Array2D(n, n) self._size = n
【练手小程序——01】迷宫问题
蝉之洞
08-08 593
http://blog.csdn.net/likee003/article/details/4974544
01迷宫问题
仅用于分享论文心得和技术
03-13 1126
这题听说有人用并查集做的......很简单的一道题，要注意的就是可能会超时，需要计算一下时间复杂度。这题问的是某一格开始能移动到多少个格子，显然这题要不就用DFS连通块要不就用BFS宽搜一下，这题很好写。但是有一个问题就是注意这个数据规模，m&lt;=100000,如果用bfs的话显然不能每次询问每次bfs，这样真的一定会超时，o(m*N*N)，N还是比较大的（N代表可移动的格数），所以肯...
第五届蓝桥杯——基础练习：十进制转十六进制
爱音乐，爱编程。
12-24 8951
问题描述 　　十六进制数是在程序设计时经常要使用到的一种整数的表示方式。它有0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F共16个符号，分别表示十进制数的0至15。十六进制的计数方法是满16进1，所以十进制数16在十六进制中是10，而十进制的17在十六进制中是11，以此类推，十进制的30在十六进制中是1E。 　　给出一个非负整数，将它表示成十六进制的形式。 输入格式
迷宫游戏python
最新发布
05-30
迷宫游戏是一种基于寻路的游戏，玩家需要通过规划自己的行动路线，找到迷宫中的出口。在Python中，可以使用pygame库来实现迷宫游戏。一般来说，实现迷宫游戏需要以下步骤： 1. 创建迷宫地图：使用二维数组来表示地图，并通过随机算法来生成迷宫。 2. 绘制迷宫：使用pygame库中的画图函数来绘制地图，包括墙壁、出口和角色等元素。 3. 角色控制：玩家需要通过键盘输入控制角色的移动，可以使用pygame库中的事件处理函数来实现。 4. 碰撞检测：在角色移动的过程中，需要检测是否与墙壁或出口发生碰撞，以便判断游戏是否结束。 5. 游戏结束：当玩家到达出口时，显示胜利画面；当玩家与墙壁发生碰撞时，显示失败画面。

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值