simple approach Manhattan Distance=∣x  1 ​  −x  2 ​  ∣+∣y  1 ​  −y  2 ​  ∣
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
```cpp []
class Solution {
public:
    bool escapeGhosts(vector<vector<int>>& ghosts, vector<int>& target) {
        int xt=target[0];
        int yt=target[1];
        int dist=abs(xt)+abs(yt);
        int n=ghosts.size();
        for (int i=0;i<n;i++){
            int a=ghosts[i][0];
            int b=ghosts[i][1];
            int c=abs((a-xt))+abs((b-yt));
            if (c<=dist) return false;

        }
        return true;
        
    }
};
```
['C++']