C++实现数组最大得分：相邻不同颜色数字之和

思路：\n1. 遍历数组，记录下每个相邻的不同颜色数字的和，放入一个新的数组中。\n2. 遍历新数组，找出其中的最大值。\n3. 返回最大值作为结果。\n\n代码实现：\ncpp\n#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n int n;\n cin >> n;\n \n vector<int> nums(n);\n for (int i = 0; i < n; i++) {\n cin >> nums[i];\n }\n\n string colors;\n cin >> colors;\n\n vector<int> sums;\n for (int i = 0; i < n - 1; i++) {\n if (colors[i] != colors[i+1]) {\n sums.push_back(nums[i] + nums[i+1]);\n }\n }\n\n int maxSum = *max_element(sums.begin(), sums.end());\n cout << maxSum << endl;\n\n return 0;\n}\n