def crop_map (m: list[list[int]], corner_1: tuple[int, int], corner 2: tuple[int, int]) -> list[list[int]]: Given a 2D representation of an elevation map and two points on the ma and , crop the map and return the smallest map such that both these coordinates are now a corner on the new map. Note that the new cropped map could just be a row, a column, or even a single square like [[1]]. The new map must remain rectangular, that is, each of its rows must be equal in length. Do not modify the original map. >>> sample_map = [[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]] >>> cгоp_mаp(sample_map, (1, 1), (2, 2)) [[6, 7], [10, 11]] >>> crop_map (sample_map, (0, 0), (3, 0)) [[1], [5], [9], [13]] >>> crop_map (sample_map, (0, 3), (0, 0)) [[1, 2, 3, 4]] pass
def crop_map (m: list[list[int]], corner_1: tuple[int, int], corner 2: tuple[int, int]) -> list[list[int]]: Given a 2D representation of an elevation map and two points on the ma and , crop the map and return the smallest map such that both these coordinates are now a corner on the new map. Note that the new cropped map could just be a row, a column, or even a single square like [[1]]. The new map must remain rectangular, that is, each of its rows must be equal in length. Do not modify the original map. >>> sample_map = [[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]] >>> cгоp_mаp(sample_map, (1, 1), (2, 2)) [[6, 7], [10, 11]] >>> crop_map (sample_map, (0, 0), (3, 0)) [[1], [5], [9], [13]] >>> crop_map (sample_map, (0, 3), (0, 0)) [[1, 2, 3, 4]] pass
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter17: Linked Lists
Section: Chapter Questions
Problem 5PE
Related questions
Question
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!
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
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT