Simple Solution || C++ Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    bool escapeGhosts(vector<vector<int>>& ghosts, vector<int>& target) {\n        int dist1 = abs(target[0]) + abs(target[1]);\n        int dist2 = INT_MAX;\n        for(auto it : ghosts){\n            dist2 = min(dist2,abs(it[0] - target[0]) + abs(it[1] - target[1]));\n        }\n        return dist1 < dist2;\n    }\n};\n```
['C++']