[Python3] O(N) approach
Intuition\n Describe your first thoughts on how to solve this problem. \nIf any of the ghosts reach the target at the same time, or before the player does, the 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nIf any of the ghosts reach the ```target``` at the same time, or before the player does, the ghosts win, else the player.\n# Approach\n<!-- Describe your approach to solving the problem. -->\nWe find out which of the ghosts is situated closest to target, and compare the manhattan distance of that to that of the player and the target.\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n$$O(n)$$ where $$n$$ is the number of ghosts.\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n$$O(1)$$\n# Code\n```\nclass Solution:\n    def escapeGhosts(self, ghosts: List[List[int]], target: List[int]) -> bool:\n        dist = inf\n        for x, y in ghosts:\n            dist = min(dist, abs(target[0]-x) + abs(target[1]-y))\n        return abs(target[0]) + abs(target[1]) < dist\n```
['Math', 'Python3']