minimizing-array-after-replacing-pairs-with-their-product.py

# Time:  O(n)
# Space: O(1)

# greedy
class Solution(object):
    def minArrayLength(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        if 0 in nums:
            return 1
        result = len(nums)
        curr = nums[0]
        for i in xrange(1, len(nums)):
            if curr*nums[i] > k:
                curr = nums[i]
            else:
                curr *= nums[i]
                result -= 1
        return result