题目:
代码(首刷看解析 day5):
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
int len=nums.size();
vector<int> left(len),right(len),answer(len);
left[0]=nums[0],right[len-1]=nums[len-1];
for(int i=len-2;i>=0;--i){
right[i]=right[i+1]*nums[i];
}
for(int i=1;i<len;++i){
left[i]=left[i-1]*nums[i];
}
for(int i=1;i<len-1;++i){
answer[i]=right[i+1]*left[i-1];
}
answer[0]=right[1];
answer[len-1]=left[len-2];
return answer;
}
};