[Java] Math Solution: Mahattan Distance
\nclass Solution {\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        if (ghosts.length == 0) {\n            return true;\n        }\n   
```\nclass Solution {\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        if (ghosts.length == 0) {\n            return true;\n        }\n        int minimum = distance(new int[]{0, 0}, target);\n        int fastest = Integer.MAX_VALUE;\n        for (int[] ghost : ghosts) {\n            fastest = Math.min(fastest, distance(ghost, target));\n        }\n        return minimum < fastest;\n    }\n    \n    private int distance(int[] p1, int[] p2) {\n        return Math.abs(p1[0] - p2[0]) + Math.abs(p1[1] - p2[1]);\n    }\n}\n```
[]