Python 3   ||   2 lines,  w/ a brief explanation  ||   T/S: 96% / 96%
The problem reduces to whether any ghostghas a manhattan-distance totargetthat is less than the manhattan-distance totargetfrom(0,0).\n\nclass Solution:\n    de
The problem reduces to whether any ghost`g`has a *manhattan-distance* to`target`that is less than the *manhattan-distance* to`target`from`(0,0)`.\n```\nclass Solution:\n    def escapeGhosts(self, ghosts: List[List[int]], target: List[int]) -> bool:\n        \n        dist = lambda x : abs(x[0] - target[0]) + abs(x[1] - target[1])\n\n        return dist((0,0)) < min(dist(g) for g in ghosts)\n```\n[https://leetcode.com/problems/escape-the-ghosts/submissions/1272573103/](https://leetcode.com/problems/escape-the-ghosts/submissions/1272573103/)\n\nI could be wrong, but I think that time complexity is *O*(*N*) and space complexity is *O*(*N*), in which *N* ~ `len(ghosts)`.\n
['Python3']