easy java solution
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public boolean escapeGhosts(int[][] ghosts, int[] target) {
        int n = Math.abs(target[0]) + Math.abs(target[1]);
        int t0 = target[0];
        int t1 = target[1];

        for (int[] g : ghosts) {
            if (n >= (Math.abs(g[0] - t0) + Math.abs(g[1] - t1))) return false;
        }

        return true;
    }
}
```
['Java']