Math ||  Easy C++ || ✅✅✅
\n# Approach\n Describe your approach to solving the problem. \nOnly take Care that, which reaches first  Ghost or You? \uD83E\uDD14\uD83E\uDD14\n\n# Complexity
\n# Approach\n<!-- Describe your approach to solving the problem. -->\nOnly take Care that, which reaches first  Ghost or You? \uD83E\uDD14\uD83E\uDD14\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 {\npublic:\n    bool escapeGhosts(vector<vector<int>>& mat, vector<int>& t) {\n        int dist = abs(t[0])+abs(t[1]);\n        for(auto x : mat)\n        {\n            int d = abs(t[0]-x[0])+abs(t[1]-x[1]);\n            if(d<=dist) return false;\n        }\n        return true;\n\n    }\n};\n```
['Math', 'C++']