Java solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        int count=Math.abs(target[0])+Math.abs(target[1]);\n        for(int i=0;i<ghosts.length;i++){\n            if((int)Math.abs(ghosts[i][0]-target[0])+(int)Math.abs(ghosts[i][1]-target[1])<=count){\n                return false;\n            }\n        }\n        return true;\n    }\n}\n```
['Java']