PLEASE debug my current code:

def available_seats(seats:list)->int:

count = 0

length = len(seats)

for i in range(length+1): #count from the first index to the last

if seats[i] == 0: #if the index is 0

if seats[i+1] == 0: #if the next index is also 0 -> the next can be seen as available seat

count +=1

i = i+2 #start from i+2 to run if loop again

elif seats[i] ==1: #if the index is 1

if seats[i+1] == 0: #if the next index is 0 (1, 0)

if seats[i+2] == 0: #check the next next index, if (1, 0, 0) -> the next next can be count as available seat

count +=1

elif seats[i+1] == 1: #if (1, 1, )

i = i +2

continue

return count

Expected Output:

PLEASE PLEASE check my current code and update using the current code given, if better plz leave an explanation for the codes... I'd really want to learn from my mistakes. Thank you so much!!

Write a method in python as following : Given an integer list of seats containing 0 's and 1 's, where 0 means empty and 1 means pre-arranged seat. Please return the maximum number of seats without violating the no-adjacent-seats rule, not including pre-arranged. For example, [1,0,0,0,1] are three unassigned seats, but in order to maintain social distance, only the middle one can be arranged as a seat, so return 1 ; Given [0,0,1,0,0], the middle is pre-arranged, the leftmost and rightmost seats can meet the epidemic prevention regulations, so return 2. Hint: Greedy For example