이슈 #450에서 솔루션 추가

LeetCode/Product_of_Array_Except_Self.cpp

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