Bouquet Counting From Binary Pattern

MediumPython

Problem

How would you compute the total number of bouquets from a binary pattern where you can form a bouquet from adjacent 0 and 1, or from three adjacent 1s?

Given a binary array, return the maximum number of disjoint bouquets. A bouquet uses either two adjacent, different bits, 01 or 10, or three adjacent 1 bits. Positions may be left unused.

Implement def max_bouquets(pattern):, where pattern is a non-empty list of integers containing only 0 and 1, and return an integer.

Constraints

1 <= len(pattern) <= 1000
Each element of pattern is either 0 or 1
Each position can be used by at most one bouquet
Positions may be left unused

Function Signature

def max_bouquets(pattern):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.