began problem, solved in o(n)^2, but needs O(n)

Top150Interview/238ProductofArrayExceptSelf.py

@@ -0,0 +1,12 @@
+def productExceptSelf(nums):
+        """
+        :type nums: List[int]
+        :rtype: List[int]
+        """
+        answer = nums
+        for i in range(len(nums)):
+            if answer[i] == nums[i]:
+                
+        return answer
+
+productExceptSelf([1,2,3,4])