Best Solution using measuring distance two ways
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```\nclass Solution {\npublic:\n    vector<int> countOfPairs(int n, int x, int y) {\n        vector<int> ans(n,0);\n        if(x>y) swap(x,y);\n        for(int i=1;i<n;i++){\n            for(int j=i+1;j<=n;j++){\n                int dis=min(j-i,abs(x-i)+1+abs(j-y));\n                ans[dis-1]+=2;\n            }\n        }\n        return ans;\n    }\n};\n```
['C++']