[leetcode]789. Escape The Ghosts

[leetcode]789. Escape The Ghosts

---

Analysis

想把拖鞋赛道实验室某男生嘴里！！！—— [生气气]

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.
简单题，直接算一下坐标差就行了（本来还以为要DFS呢）

Implement

class Solution {
public:
    bool escapeGhosts(vector<vector<int>>& ghosts, vector<int>& target) {
        int len_g = ghosts.size();
        int step = abs(target[0]) + abs(target[1]);
        for(int i=0; i<len_g; i++){
            int cnt = abs(ghosts[i][0]-target[0])+abs(ghosts[i][1]-target[1]);
            if(cnt <= step)
                return false;
        }
        return true;
    }
};