def longest_chain (lst: List[int]) -> int: Given a list of integers, return the length of the longest chain of 1's that start from the beginning. You MUST Use a while loop for this, and are not allowed to use a for loop.
def longest_chain (lst: List[int]) -> int: Given a list of integers, return the length of the longest chain of 1's that start from the beginning. You MUST Use a while loop for this, and are not allowed to use a for loop.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
you must include a while loop in this function
you should not us any of the following:
- dictionaries or dictionary methods
- try-except
- break and continue statements
- recursion
- map / filter

Transcribed Image Text:LAB RESTRICTIONS, PLEASE READ:
Do not add any imports, the ones that you need will be given to you.
You may not use any dictionaries or dictionary methods.
Do not use try-except statements, you should be able to anticipate
or prevent any errors from happening at all!
from typing import Any, List
![def longest_chain(lst: List[int]) -> int:
II II II
Given a list of integers, return the length of the longest chain of 1's
that start from the beginning.
You MUST use a while loop for this, and are not allowed to use a for loop.
Hint: A good way to start is to define a stopping condition, and have a
variable that keeps track of how many 1's you've seen thus far, if any.
Precondition: <lst> will only contain the integers 1 and 0.
>>> longest_chain([1, 1, 0])
2
>>> Longest_chain([0, 1, 1])
>>> longest_chain([1, 0, 1, 1])
1
pass](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F2e9e339e-2841-4d7f-bb32-e8e5b2ddcf58%2F397fb7c9-8f03-41f9-b86a-068abef77efc%2Fzhs6c81_processed.jpeg&w=3840&q=75)
Transcribed Image Text:def longest_chain(lst: List[int]) -> int:
II II II
Given a list of integers, return the length of the longest chain of 1's
that start from the beginning.
You MUST use a while loop for this, and are not allowed to use a for loop.
Hint: A good way to start is to define a stopping condition, and have a
variable that keeps track of how many 1's you've seen thus far, if any.
Precondition: <lst> will only contain the integers 1 and 0.
>>> longest_chain([1, 1, 0])
2
>>> Longest_chain([0, 1, 1])
>>> longest_chain([1, 0, 1, 1])
1
pass
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 1 images

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education