알고리즘문제풀이

[LeetCode/릿코드] - 238. Product of Array Except Self (Medium/미디엄)

238. Product of Array Except Self 문제: Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer. You must write an algorithm that runs in O(n) time and without using the division operation. 문제 해설: 1. 정수 숫자 배열이 주어진다. 2. 자기 자신을 제외한 모..