C++ 4 Line || Mahnattan distance || Easy to understand Clean Code
Compare mInimum Manhattan Distance between by any ghost-target and player position-target\n\nclass Solution {\npublic:\n    \n    bool escapeGhosts(vector<vecto
**Compare mInimum Manhattan Distance between by any ghost-target and player position-target**\n```\nclass Solution {\npublic:\n    \n    bool escapeGhosts(vector<vector<int>>& ghosts, vector<int>& target) {\n        int minimumstepsreqbyplayer = abs(target[0]) + abs(target[1]);\n        int minimumstepsreqbyanyghost = INT_MAX;\n        \n        for(auto x: ghosts){\n            minimumstepsreqbyanyghost = min(minimumstepsreqbyanyghost, abs(x[0]-target[0]) + abs(x[1]-target[1]));\n        }\n        \n        return minimumstepsreqbyplayer<minimumstepsreqbyanyghost;\n    }\n};\n```
['C', 'C++']