class Solution {
public:
vector<int> runningSum(vector<int>& nums) {
int n=nums.size();
for(int y=0;y<n-1;y++){
nums[y+1]=nums[y]+nums[y+1];
}
return nums;
}
};
作者:festive-fermat4ec
链接:https://leetcode.cn/problems/running-sum-of-1d-array/solution/by-festive-fermat4ec-548h/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。