675. Cut Off Trees for Golf Event
来源:互联网 发布:zookeeper java开发 编辑:程序博客网 时间:2024/06/05 16:30
You are asked to cut off trees in a forest for a golf event. The forest is represented as a non-negative 2D map, in this map:
0
represents theobstacle
can't be reached.1
represents theground
can be walked through.The place with number bigger than 1
represents atree
can be walked through, and this positive number represents the tree's height.
You are asked to cut off all the trees in this forest in the order of tree's height - always cut off the tree with lowest height first. And after cutting, the original place has the tree will become a grass (value 1).
You will start from the point (0, 0) and you should output the minimum steps you need to walk to cut off all the trees. If you can't cut off all the trees, output -1 in that situation.
You are guaranteed that no two trees
have the same height and there is at least one tree needs to be cut off.
Example 1:
Input: [ [1,2,3], [0,0,4], [7,6,5]]Output: 6
Example 2:
Input: [ [1,2,3], [0,0,0], [7,6,5]]Output: -1
Example 3:
Input: [ [2,3,4], [0,0,5], [8,7,6]]Output: 6Explanation: You started from the point (0,0) and you can cut off the tree in (0,0) directly without walking.
Hint: size of the given matrix will not exceed 50x50.
思路:BFS,外面套层循环
package l675;import java.util.ArrayList;import java.util.Collections;import java.util.HashMap;import java.util.LinkedList;import java.util.List;import java.util.Map;import java.util.Queue;/* * 每次BFS找一个路径 */class Solution { public int cutOffTree(List<List<Integer>> forest) { int[][] a = new int[forest.size()][forest.get(0).size()]; for(int i=0; i<forest.size(); i++) for(int j=0; j<forest.get(0).size(); j++) a[i][j] = forest.get(i).get(j); List<Integer> l = new ArrayList<Integer>(); Map<Integer, int[]> map = new HashMap<Integer, int[]>(); for(int i=0; i<a.length; i++) for(int j=0; j<a[0].length; j++) { if(a[i][j] != 0)l.add(a[i][j]); map.put(a[i][j], new int[]{i, j}); } Collections.sort(l); int ret = 0; int[] cur = new int[]{0, 0}; for(int i : l) { int tmp = getStep(a, cur, map.get(i)); if(tmp == -1)return -1; ret += tmp; cur = map.get(i); } return ret; }private int getStep(int[][] a, int[] cur, int[] end) {boolean[][] m = new boolean[a.length][a[0].length];int[][] d = new int[][]{{0,1},{0,-1},{1,0},{-1,0}};int step = 0;boolean f = false;Queue<int[]> q = new LinkedList<int[]>();Queue<int[]> qq = new LinkedList<int[]>();q.add(cur);while(!q.isEmpty()) {int[] t = q.remove();if(t[0]==end[0] && t[1]==end[1]) {f = true;break;}for(int i=0; i<4; i++) {int x = t[0] + d[i][0], y = t[1] + d[i][1];if(x<0||y<0||x>=a.length||y>=a[0].length||a[x][y]==0||m[x][y])continue;qq.add(new int[]{x,y});m[x][y] = true;}if(q.isEmpty()) {q = qq;qq = new LinkedList<int[]>();step ++;}}return f ? step : -1;}}
- 675. Cut Off Trees for Golf Event
- 675. Cut Off Trees for Golf Event
- LWC 49:675. Cut Off Trees for Golf Event
- LeetCode 675. Cut Off Trees for Golf Event
- LeetCode 675. Cut Off Trees for Golf Event
- leetcode675. Cut Off Trees for Golf Event(Hard)
- leetcode 675. Cut Off Trees for Golf Event 广度优先遍历BFS
- Link-Cut Trees 板子
- Golf
- 动态树 Link-Cut Trees
- 动态树之Link-Cut Trees
- BZOJ 1180 [CROATIAN2009]OTOCI Link Cut Trees
- BZOJ 3282 Tree link cut trees
- 一个英语笑话:Cut off my dog's tail
- 如何解决cut off中文字符(unicode)产生的乱码
- 【hdu4010】【link-cut tree】Query on The Trees
- Hdu 4010 Query on The Trees lct link-cut tree
- 动态树问题与Link-Cut Trees学习笔记
- windows+jenkins+robotframework无法修改浏览器分辨率
- a标签总结
- linux下安装python3.5
- hdu 2546 饭卡 (01背包)
- shell 函数
- 675. Cut Off Trees for Golf Event
- cookie学习笔记-通过数组读取cookie
- Python的switch方法
- R语言多线程运算(解决R循环慢的问题)
- CashRegSys
- mave工程自学初探
- oracle 多表查询
- 用 C# 写 TCP socket 连接
- 开发中用到的正则表达式