Python 3 | Manhattan Distance, Math | Explanation
Explanation\n- Since ghosts can stay still, this question becomes much easier. \n- The best strategy for ghosts to intercept player is to racing the shortest di
### Explanation\n- Since `ghosts` can **stay still**, this question becomes much easier. \n- The best strategy for `ghosts` to intercept player is to racing the shortest distance to the `target` and wait there\n- Thus, from a player\'s perspective, we just need to make sure we can reach to `target` at least 1 step faster than any `ghosts`\n\t- Note: If player and `ghosts` use same number of steps to reach to `target`, then it is considered as a failure.\n### Implementation\n```\nclass Solution:\n    def escapeGhosts(self, ghosts: List[List[int]], target: List[int]) -> bool:\n        t_x, t_y = target\n        m_x, m_y = abs(t_x), abs(t_y)\n        for x, y in ghosts:\n            manhattan = abs(t_x - x) + abs(t_y - y)\n            if manhattan <= m_x + m_y:\n                return False\n        return True\n```
['Math', 'Python', 'Python3']