I need help on how to add code 2 into code 1, so together they can be one code code 1: def large_position(matrix: list[list[int]], row: int, col: int) -> int: a = row b = col max = 0 temp = 0 rows = len(matrix) column = len(matrix[a]) while a < rows and matrix[a][col] == 1: temp = 0 while b < column and matrix[a][b] == 1: temp = temp + 1 b = b + 1 column = b a = a + 1 if (a != row+1): temp2 = temp * (a - row) else: temp2 = temp if max < temp2: max = temp2 b = col return max and code 2: def long_chain(lst: list[int]) -> int: count_list = 0 i = 0 while i < len(lst) and lst[i] != 0: i = i + 1 count_list = count_list + 1 return count_list " please remember its code 2 into code 1, so that code 1 looks simpler"
I need help on how to add code 2 into code 1, so together they can be one code code 1: def large_position(matrix: list[list[int]], row: int, col: int) -> int: a = row b = col max = 0 temp = 0 rows = len(matrix) column = len(matrix[a]) while a < rows and matrix[a][col] == 1: temp = 0 while b < column and matrix[a][b] == 1: temp = temp + 1 b = b + 1 column = b a = a + 1 if (a != row+1): temp2 = temp * (a - row) else: temp2 = temp if max < temp2: max = temp2 b = col return max and code 2: def long_chain(lst: list[int]) -> int: count_list = 0 i = 0 while i < len(lst) and lst[i] != 0: i = i + 1 count_list = count_list + 1 return count_list " please remember its code 2 into code 1, so that code 1 looks simpler"
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
Heyy,
I need help on how to add code 2 into code 1, so together they can be one code
code 1:
def large_position(matrix: list[list[int]], row: int, col: int) -> int:
a = row
b = col
max = 0
temp = 0
rows = len(matrix)
column = len(matrix[a])
while a < rows and matrix[a][col] == 1:
temp = 0
while b < column and matrix[a][b] == 1:
temp = temp + 1
b = b + 1
column = b
a = a + 1
if (a != row+1):
temp2 = temp * (a - row)
else:
temp2 = temp
if max < temp2:
max = temp2
b = col
return max
and
code 2:
def long_chain(lst: list[int]) -> int:
count_list = 0
i = 0
while i < len(lst) and lst[i] != 0:
i = i + 1
count_list = count_list + 1
return count_list
" please remember its code 2 into code 1, so that code 1 looks simpler"
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 2 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