Please use a different code to solve this question Given an string representing a 2D array of integers that contains the locations of the two skyscrapers, find the shortest possible path that connects the two skyscrapers and return the length of that path. A skyscraper is defined to be a 4-directionally connected group i.e. North-South-East-West, no diagonals), and can consist of multiple "parts" such that the initial size of the skyscraper is not one single cell. 1's represent a cell that is part of the skyscraper, and 0's represent cells that are empty air. You will join the path to the other skyscraper by adding planks to spots containing 0's where each cell represents one unit of distance. You can only add planks to spots connected to either a skyscraper or another 2x4 (i.e. you cannot "jump" over a gap), and you can only do so 4-directionally. Return the smallest number of planks needed to make the crossing. Case 1: Input: {[1,0,0,0],[0,0,0,0], [0,1,1,0],[0,0,1,1]} Output: 2 Case 2: Input: {[1,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,1,1],[0,1,1,0,0]} Output: 3 Case 3: Input: {[0,0,0,0,0,0,0,0,0,0],[0,0,1,1,0,0,1,0,1,1],[0,0,0,1,1,1,1,0,1,0], [0,0,1,1,0,1,1,1,1,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0], [0,0,0,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0,0,0],[1,1,0,0,1,1,0,0,1,0], [1,1,1,1,1,1,1,1,1,0]}
Output: 4
Please use a different code to solve this question Given an string representing a 2D array of integers that contains the locations of the two skyscrapers, find the shortest possible path that connects the two skyscrapers and return the length of that path. A skyscraper is defined to be a 4-directionally connected group i.e. North-South-East-West, no diagonals), and can consist of multiple "parts" such that the initial size of the skyscraper is not one single cell. 1's represent a cell that is part of the skyscraper, and 0's represent cells that are empty air. You will join the path to the other skyscraper by adding planks to spots containing 0's where each cell represents one unit of distance. You can only add planks to spots connected to either a skyscraper or another 2x4 (i.e. you cannot "jump" over a gap), and you can only do so 4-directionally. Return the smallest number of planks needed to make the crossing. Case 1: Input: {[1,0,0,0],[0,0,0,0], [0,1,1,0],[0,0,1,1]} Output: 2 Case 2: Input: {[1,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,1,1],[0,1,1,0,0]} Output: 3 Case 3: Input: {[0,0,0,0,0,0,0,0,0,0],[0,0,1,1,0,0,1,0,1,1],[0,0,0,1,1,1,1,0,1,0], [0,0,1,1,0,1,1,1,1,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0], [0,0,0,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0,0,0],[1,1,0,0,1,1,0,0,1,0], [1,1,1,1,1,1,1,1,1,0]} Output: 4
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
Please use a different code to solve this question
Given an string representing a 2D array of integers that contains the locations of the two skyscrapers, find the shortest possible path that connects the two skyscrapers and return the length of that path. A skyscraper is defined to be a 4-directionally connected group i.e. North-South-East-West, no diagonals), and can consist of multiple "parts" such that
the initial size of the skyscraper is not one single cell. 1's represent a cell that is part of the skyscraper, and 0's represent cells that are empty air. You will join the path to the other skyscraper by adding planks to spots containing 0's where each cell represents one unit of distance. You can only add planks to spots connected to either a skyscraper or another 2x4 (i.e. you cannot "jump" over a gap), and you can only do so 4-directionally. Return the smallest number of planks needed to make the crossing.
Case 1: Input: {[1,0,0,0],[0,0,0,0], [0,1,1,0],[0,0,1,1]}
Output: 2
Case 2: Input: {[1,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,1,1],[0,1,1,0,0]}
Output: 3
Case 3: Input: {[0,0,0,0,0,0,0,0,0,0],[0,0,1,1,0,0,1,0,1,1],[0,0,0,1,1,1,1,0,1,0], [0,0,1,1,0,1,1,1,1,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0], [0,0,0,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0,0,0],[1,1,0,0,1,1,0,0,1,0],
[1,1,1,1,1,1,1,1,1,0]}
Output: 4
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 3 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