class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
if(nums.size() == 0 ) {
return {};
}
vector<int> ans(nums.size());
int L = 1;
ans[0] = 1;
for(int i = 1;i < nums.size(); ++i) {
ans[i] = nums[i - 1] * ans[i - 1];
}
int R = 1;
for(int i = nums.size() - 1;i >= 0; i--) {
ans[i] = ans[i] * R;
R *= nums[i];
}
return ans;
}
};
【数组】【头到尾尾到头】leetcode.238. 除自身以外数组的乘积
最新推荐文章于 2023-01-05 15:54:01 发布