배열을 입력받아 output[i]가 자신을 제외한 나머지 모든 요소를 곱셈 결과가 되도록 출력하라.
Input: nums = [1,2,3,4]
Output: [24,12,8,6]
Input: nums = [-1,1,0,-3,3]
Output: [0,0,9,0,0]
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
vector<int>res(nums.size(), 1);
for (int i = 1; i < nums.size(); i++)
res[i] = res[i - 1] * nums[i - 1];
int right = 1;
for (int i = nums.size() - 1; i >= 0; i--) {
res[i] *= right;
right *= nums[i];
}
return res;
}
};
vector<int>res(nums.size(), 1);
for (int i = 1; i < nums.size(); i++)
res[i] = res[i - 1] * nums[i - 1];
int right = 1;
for (int i = nums.size() - 1; i >= 0; i--)
{
res[i] *= right;
right *= nums[i];
}
Runtime 30 ms / Memory 24.1 MB
https://leetcode.com/problems/product-of-array-except-self/submissions/887962778/