My java 0ms solution 100% faster
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```java []\nclass Solution {\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        int min = Math.abs(target[0]) + Math.abs(target[1]);\n        for(int[] g : ghosts){\n            if(Math.abs(g[0] - target[0]) + Math.abs(g[1] - target[1]) <= min){\n                return false;\n            }\n        }\n        return true;\n    }\n}\n```
['Java']