Method totalFruit

Array/FruitIntoBaskets.py:96–145

:type tree: List[int] :rtype: int

(self, tree)

"""
class Solution(object):
    def totalFruit(self, tree):
        """
        :type tree: List[int]
        :rtype: int
        """
        # [{count, repeat_count, capacity, self-value}, ]
        tree_seed = [
                        {'count': 1, 'repeat_count': 1, 'capacity': set([tree[0]]), 'self_value': tree[0]}
                    ]
        
        for i in range(1, len(tree)):
            prev = tree_seed[i-1]
            
            # repeat self_value
            if tree[i] == prev.get('self_value'):
                tree_seed.append({'count': prev.get('count') + 1,
                                 'repeat_count': prev.get('repeat_count') + 1,
                                 'capacity': prev.get('capacity'),
                                 'self_value': tree[i]})
                continue
            
            # already into basket but cannot beside each other.
            
            if tree[i] in prev.get('capacity'):
                tree_seed.append({'count': prev.get('count') + 1,
                                 'repeat_count': 1,
                                 'capacity': prev.get('capacity'),
                                 'self_value': tree[i]})
                continue     
            
            # != but can taken into basket.
            if len(tree_seed[i-1].get('capacity')) == 1:
                new = prev.get('capacity')
                new.add(tree[i])
                
                tree_seed.append({'count': prev.get('count') + 1,
                                 'repeat_count': 1,
                                 'capacity': new,
                                 'self_value': tree[i]})
                continue
                
            # Found Third-fruit.
            new = set()
            new.add(tree[i])
            new.add(tree[i-1])
            tree_seed.append({'count': tree_seed[i-1].get('repeat_count') + 1,
                             'repeat_count': 1,
                             'capacity': new,
                             'self_value': tree[i]})    
        return max(tree_seed, key=lambda x: x['count']).get('count')
            
#         maxes = 0
#         one = None