Leetcode 789. Escape The Ghosts

You are playing a simplified Pacman game. You start at the point (0, 0), and your destination is (target[0], target[1]). There are several ghosts on the map, the i-th ghost starts at (ghosts[i][0], ghosts[i][1]).

Each turn, you and all ghosts simultaneously *may* move in one of 4 cardinal directions: north, east, west, or south, going from the previous point to a new point 1 unit of distance away.

You escape if and only if you can reach the target before any ghost reaches you (for any given moves the ghosts may take.)  If you reach any square (including the target) at the same time as a ghost, it doesn't count as an escape.

Return True if and only if it is possible to escape.

Example 1:
Input: 
ghosts = [[1, 0], [0, 3]]
target = [0, 1]
Output: true
Explanation: 
You can directly reach the destination (0, 1) at time 1, while the ghosts located at (1, 0) or (0, 3) have no way to catch up with you.

Example 2:
Input: 
ghosts = [[1, 0]]
target = [2, 0]
Output: false
Explanation: 
You need to reach the destination (2, 0), but the ghost at (1, 0) lies between you and the destination.

Example 3:
Input: 
ghosts = [[2, 0]]
target = [1, 0]
Output: false
Explanation: 
The ghost can reach the target at the same time as you.

Note:

• All points have coordinates with absolute value <= 10000.
• The number of ghosts will not exceed 100.

题目大意，这是个吃豆子游戏，有很多怪兽，豆子在(target[0],target[1])的位置上，你一开始在(0,0)位置上，怪兽也在他们相应的位置上，每一轮，你可以走东南西北四个方向，怪兽亦是如此，如果你在吃豆子的路上遇到了怪兽，那么你就被吃掉了，死了。

分析:

按照我的想法，我以为要dfs，然后遍历所有可能的结果，但发现不对，要dfs好歹得有个二维数组把，但仔细看，发现没有，

然后就去看了答案。

主要分析是这样的。

一开始你在C点，然后鬼在B点，豆子在A点，如果你在赶往豆子的路上被鬼阻击了，假设AC上存在一点D使得CD=DB，那么AC=CD+AD=CDB+AD>DB(三角形两边之和大于第三边)，那么鬼至少可以像你一样早到达目标。 所以，无论鬼在何处开始（以及阻击点在哪里），它最好的机会让你直接进入目标并在那里等待，而不是在中间拦截你。

这个思路可以，咋们可以直接求出咋们出发点距离目标点的距离，如果有任何一只鬼的距离(离豆子)比咋们近的话，咋们就死定了。

public boolean escapeGhosts(int[][] ghosts, int[] target) {
        int max=Math.abs(target[0])+Math.abs(target[1]);
        for(int[] ghost:ghosts) {
            int d=Math.abs(ghost[0]-target[0])+Math.abs(ghost[1]-target[1]);
            if(d<=max)return false;
        }
        return true;
}

参考连接:https://leetcode.com/problems/escape-the-ghosts/discuss/116678/Why-interception-in-the-middle-is-not-a-good-idea-for-ghosts.
https://leetcode.com/problems/escape-the-ghosts/discuss/116507/Java-5-liner