class Solution {
public:
int maxSubArray(vector<int>& nums) {
vector<int> tp = nums;
int large_sum ;
sort(tp.begin(),tp.end());
large_sum = *tp.end();
int step = 2;
for( int i = 0; i + step <= tp.size() ;i++){
tp.at(i) = tp.at(i) + nums.at(i+step-1);
large_sum = large_sum < tp.at(i) ? tp.at(i) : large_sum;
}
return large_sum;
}
};
53
最新推荐文章于 2023-10-16 14:21:57 发布