class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
int n = nums.size();
vector<int> output(n,1);//初始化一个全为1的向量
for(int i=1;i<n;i++){
output[i] = output[i-1]*nums[i-1];
}
int end=1;
for(int i=n-1;i>=0;i--){
output[i]*=end;
end *=nums[i];
}
return output;
}
};
238 https://leetcode-cn.com/problems/product-of-array-except-self/
最新推荐文章于 2022-03-23 21:56:23 发布