Complete largest_at_position with the help of longest_chain. Can't use recursion, or any imports

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
icon
Related questions
Question
Complete largest_at_position with the help of longest_chain. Can't use recursion, or any imports
edef largest_at_position(matrix: list[list[int]], row: int, col: int) -> int:
Returns the area of the largest rectangle whose top left corner is at
position <row>, <col> in <matrix>.
You MUST make use of the helper <longest_chain> here as you loop through
each row of the matrix. Do not modify (i.e., mutate) the input matrix.
>>> case1 = [[1, 0, 1, 0, 0],
[1, 0, 1, 1, 1],
[1, 1, 1, 1, 1],
[1, 0, 0, 1, 0]]
-2
>>> largest_at_position (case1, 0, 0)
3
4
54
>>> largest_at_position(case1, 2, 0)
55
56
>>> largest_at_position (case1, 1, 2)
57
6.
58
59
pass
68
61
longest_chain)
Transcribed Image Text:edef largest_at_position(matrix: list[list[int]], row: int, col: int) -> int: Returns the area of the largest rectangle whose top left corner is at position <row>, <col> in <matrix>. You MUST make use of the helper <longest_chain> here as you loop through each row of the matrix. Do not modify (i.e., mutate) the input matrix. >>> case1 = [[1, 0, 1, 0, 0], [1, 0, 1, 1, 1], [1, 1, 1, 1, 1], [1, 0, 0, 1, 0]] -2 >>> largest_at_position (case1, 0, 0) 3 4 54 >>> largest_at_position(case1, 2, 0) 55 56 >>> largest_at_position (case1, 1, 2) 57 6. 58 59 pass 68 61 longest_chain)
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!
def longest_chain(lst: list[int]) -> int:
Your longest_chain function from last week, make sure this works properly
before proceeding with the rest of the lab!
Count = 0
i = 0
while i < len (lst) and lst[i] != 0:
i += 1
Count + 1
return count
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! def longest_chain(lst: list[int]) -> int: Your longest_chain function from last week, make sure this works properly before proceeding with the rest of the lab! Count = 0 i = 0 while i < len (lst) and lst[i] != 0: i += 1 Count + 1 return count
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 1 images

Blurred answer
Knowledge Booster
Randomized Select Algorithm
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education