python-leetcode/product-of-array-except-self.py at master · mindheist/python-leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
# product-of-array-except-self
# sucessfully reduced the Time complexity from O(n^2) to O(n)
# still failing on three tests, 14/17 tests passed for the following solution
class Solution(object):
    def productExceptSelf(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """

        if len(nums)==1:
            return nums
        elif len(nums)==2:
            return nums[::-1]
        else:
            result = 1
            non_zero_result = 1
            for i in xrange(len(nums)):
                result = result * nums[i]

            for i in xrange(len(nums)):
                non_zero_result = non_zero_result * nums[i]

            results_list = []

            for i in xrange(len(nums)):
                if nums[i]!=0:
                    results_list.append(result/nums[i])
                else:
                    results_list.append(result)
            return results_list

my_solution = Solution()
print my_solution.productExceptSelf([1,2,3,4,5])
print my_solution.productExceptSelf([1,0])
#print my_solution.productExceptSelf([0])