Simple and Straightforward Solution
Complexity\n- Time complexity:$O(n)$\n Add your time complexity here, e.g. O(n) \n\n- Space complexity:$O(1)$\n Add your space complexity here, e.g. O(n) \n\n# 
# Complexity\n- Time complexity:$O(n)$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:$O(1)$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def escapeGhosts(self, ghosts: List[List[int]], target: List[int]) -> bool:\n        steps = abs(0 - target[0]) + abs(0 - target[1])\n        for ghost in ghosts:\n            Gstep = abs(ghost[0] - target[0]) + abs(ghost[1] - target[1])\n            if Gstep <= steps:\n                return False\n        return True\n```
['Python3']