Simple Java Solution
Intuition\n Describe your first thoughts on how to solve this problem. \nSimple logic: If a ghost can get to the target square in fewer (or equal) moves as the 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nSimple logic: If a ghost can get to the target square in fewer (or equal) moves as the player, then the player will always lose. \n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nWe can assume that the ghost will always take the most optimal path, which therefore is the shortest path to the target. The shortest path will have the length which is the manhattan distance from the target and the ghost (as movement is only in the cardinal directions). \n\nNow, we need to calculate the shortest path distance from the player to the target. Then, we compute the shortest path distance for every ghost and check if it is less than or equal to the player. If true, then we immediately return false. \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```\nclass Solution {\n    public boolean escapeGhosts(int[][] ghosts, int[] target) {\n        int dist = Math.abs(target[0]) + Math.abs(target[1]);\n\n        for (int i = 0; i < ghosts.length; i++) {\n            int x = ghosts[i][0]; int y = ghosts[i][1];\n            int ghostDist = Math.abs(target[0] - x) + Math.abs(target[1] - y);\n            if (ghostDist <= dist) return false;\n        }\n        return true;\n    }\n}\n```
['Java']