LeetCode 904. Fruit Into Baskets

Description

https://leetcode.com/problems/fruit-into-baskets/

You are visiting a farm that has a single row of fruit trees arranged from left to right. The trees are represented by an integer array fruits where fruits[i] is the type of fruit the ith tree produces.

You want to collect as much fruit as possible. However, the owner has some strict rules that you must follow:

• You only have two baskets, and each basket can only hold a single type of fruit. There is no limit on the amount of fruit each basket can hold.
• Starting from any tree of your choice, you must pick exactly one fruit from every tree (including the start tree) while moving to the right. The picked fruits must fit in one of your baskets.
• Once you reach a tree with fruit that cannot fit in your baskets, you must stop.

Given the integer array fruits, return the maximum number of fruits you can pick.

Example 1:

Input: fruits = [1,2,1]
Output: 3
Explanation: We can pick from all 3 trees.

Example 2:

Input: fruits = [0,1,2,2]
Output: 3
Explanation: We can pick from trees [1,2,2].
If we had started at the first tree, we would only pick from trees [0,1].

Example 3:

Input: fruits = [1,2,3,2,2]
Output: 4
Explanation: We can pick from trees [2,3,2,2].
If we had started at the first tree, we would only pick from trees [1,2].

Example 4:

Input: fruits = [3,3,3,1,2,1,1,2,3,3,4]
Output: 5
Explanation: We can pick from trees [1,2,1,1,2].

Constraints:

• 1 <= fruits.length <= 105
• 0 <= fruits[i] < fruits.length

Explanation

Regardless of the description, the problem is the same as LeetCode 159. Longest Substring with At Most Two Distinct Characters

Python Solution

class Solution:
    def totalFruit(self, fruits: List[int]) -> int:
        if not fruits:
            return 0
        
        maximum = 0
        counter = {}
        j = 0
        for i in range(len(fruits)):
            
            while j < len(fruits) and (len(counter) < 2 or len(counter) == 2 and fruits[j] in counter):
                counter[fruits[j]] = counter.get(fruits[j], 0) + 1
                
                j += 1
                
                
            if len(counter) <= 2:
                maximum = max(maximum, j - i) 
                
            counter[fruits[i]] -= 1
            
            if counter[fruits[i]] == 0:
                del counter[fruits[i]]
            
            
        return maximum

• Time Complexity: ~N
• Space Complexity: ~N