2주차 문제 풀이 1개 추가

- Product of Array Except Self

Author: hwi-middle

product-of-array-except-self/hw-middle.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    vector<int> productExceptSelf(vector<int>& nums) {
+        int n = nums.size();
+        vector<int> ans(n);
+
+        ans[0] = 1;
+        for (int i = 1; i < n; i++)
+        {
+            ans[i] = ans[i-1] * nums[i-1];
+        }
+
+        int suffix = 1;
+        for (int i = n-1; i >= 0; i--) 
+        {
+            ans[i] *= suffix;
+            suffix *= nums[i];
+        }
+
+        return ans;
+    }
+};