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:
Heyy,
I need help on how to add code 2 into code 1, so together they can be one code, don't change any code please use what is given here and don't copy from any given answers.
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"
Step by step
Solved in 2 steps
