[Java] 0ms + explanations
\nclass Solution {\n    /** Algorithm\n        1. In order to escape ghosts, the player needs to be the closest object to the target.\n           If one ghost i
```\nclass Solution {\n    /** Algorithm\n        1. In order to escape ghosts, the player needs to be the closest object to the target.\n           If one ghost is closer or equal distance, then the ghost can catch the player\n        2. Determine the distance from 0,0 to target (make sure you use absolute values)\n        3. Loop over the ghosts and calculate their distance to the target. If one ghost is closer or equal to the target, return false.\n        4. Return true at the end of loop.\n    */\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        int targetDistance = Math.abs(target[0]) + Math.abs(target[1]);\n        for (int[] ghost : ghosts) {\n            if (targetDistance >= (Math.abs(ghost[0] - target[0]) + Math.abs(ghost[1] - target[1]))) {\n                return false;\n            }\n        }\n        return true;\n    }\n}\n```
['Geometry', 'Java']