Easy C++ Solution and easy to understand.
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:O(nlogn)\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    int sumDistance(vector<int>& nums, string s, int d) {\n        int mod = 1000000007;\n          int n = nums.size();\n \n    for (int i = 0; i < n; i++){\n         if (s[i] == \'L\')\n            nums[i] -= d;\n        else \n            nums[i] += d;\n    }\n    sort(nums.begin(), nums.end());\n    long long sum =0 , ans =0;\n    for(long long i=0 ; i<n ; i++){\n        ans = (ans + (nums[i] * i - sum)%mod)%mod;\n        sum = (sum + nums[i])%mod;\n    }\n       return ans; \n    }\n};\n```
['C++']