789. Escape The Ghosts

题目：

You are playing a simplified PAC-MAN game on an infinite 2-D grid. You start at the point [0, 0], and you are given a destination point target = [xtarget, ytarget], which you are trying to get to. There are several ghosts on the map with their starting positions given as an array ghosts, where ghosts[i] = [xi, yi] represents the starting position of the ith ghost. All inputs are integral coordinates.

Each turn, you and all the ghosts may independently choose to either move 1 unit in any of the four cardinal directions: north, east, south, or west or stay still. All actions happen simultaneously.

You escape if and only if you can reach the target before any ghost reaches you. If you reach any square (including the target) at the same time as a ghost, it does not count as an escape.

Return true if it is possible to escape, otherwise return false.

Example 1:

Input: ghosts = [[1,0],[0,3]], target = [0,1]
Output: true
Explanation: You can reach the destination (0, 1) after 1 turn, while the ghosts located at (1, 0) and (0, 3) cannot 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.

Example 4:

Input: ghosts = [[5,0],[-10,-2],[0,-5],[-2,-2],[-7,1]], target = [7,7]
Output: false

Example 5:

Input: ghosts = [[-1,0],[0,1],[-1,0],[0,1],[-1,0]], target = [0,0]
Output: true

Constraints:

• 1 <= ghosts.length <= 100
• ghosts[i].length == 2
• -104 <= xi, yi <= 104
• There can be multiple ghosts in the same location.
• target.length == 2
• -104 <= xtarget, ytarget <= 104

思路：

这题基础思路就是在你到达目的地前，不可以有ghost比你先到。在迷宫中，横着也是一步，竖着也是一步，不论怎么走，从原点到目的地，横着走的步数和竖着走的步数的和必然是相同的，想通这一点很重要。那么只要计算原点和目的地的总步数作为标杆，再将ghost和目的地的总数一一计算后和标杆对比，只要小于等于标杆则返回false；如果都严格比标杆远就返回true。

代码：

class Solution {
public:
    bool escapeGhosts(vector<vector<int>>& ghosts, vector<int>& target) {
        vector<int> ini = {0, 0};
        int count = track(ini, target);
        for (auto &g : ghosts) {
            int tmp = track(g, target);
            if (tmp <= count)
                return false;
        }
        return true;
    }
private:
    int track(vector<int> &a, vector<int>& b) {
        return abs(a[0] - b[0]) + abs(a[1] - b[1]);
    }
};