- 博客(2)
- 资源 (5)
- 收藏
- 关注
原创 啊哈算法-BFS解救小哈python版
BFS 啊哈算法-解决小哈 nextstep = [[0,1], [1,0], [0,-1], [-1,0] ] n,m = map(int,input().split()) queue = [[0 for i in range(3)] for j in range(500)] book = [[0 for i in range(m)] for j in range(n)] atlas = [input().sp
2021-04-02 19:53:06 258 1
原创 啊哈算法-DFS解救小哈python版
DFS 啊哈算法-解救小哈 maze_map = [] n,m = map(int,(input()).split()) maze_map = [input().split() for i in range(n)] sp0,sp1,ep0,ep1 = map(int,input().split()) book = [[0 for _ in range(m)] for _ in range(n)] mina = 99999 def dfs(x,y,step): global mina,row,m
2021-04-02 19:17:42 194
基于arm嵌入式系统设计实验报告
2020-12-28
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人