Given a list of integers, let's decide that two consecutive items in the list are neighbours if their difference is 1. So, items 1 and 2 would be neighbours, and so would items 56 and 55. Please write a function named longest_series_of_neighbours, which looks for the longest series of neighbours within the list, and returns its length. For example, in the list [1, 2, 5, 4, 3, 4] the longest list of neighbours would be [5, 4, 3, 4], with a length of 4. An example function call: my_list = [1, 2, 5, 7, 6, 5, 6, 3, 4, 1, 0] print (longest_series_of_neighbours (my_list)) 4 Sample output
Given a list of integers, let's decide that two consecutive items in the list are neighbours if their difference is 1. So, items 1 and 2 would be neighbours, and so would items 56 and 55. Please write a function named longest_series_of_neighbours, which looks for the longest series of neighbours within the list, and returns its length. For example, in the list [1, 2, 5, 4, 3, 4] the longest list of neighbours would be [5, 4, 3, 4], with a length of 4. An example function call: my_list = [1, 2, 5, 7, 6, 5, 6, 3, 4, 1, 0] print (longest_series_of_neighbours (my_list)) 4 Sample output
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
Can you use Python
Thanks
![Given a list of integers, let's decide that two consecutive items in the list are neighbours if
their difference is 1. So, items 1 and 2 would be neighbours, and so would items 56 and
55.
Please write a function named longest_series_of_neighbours, which looks for the
longest series of neighbours within the list, and returns its length.
For example, in the list [1, 2, 5, 4, 3, 4] the longest list of neighbours would be [5,
4, 3, 4], with a length of 4.
An example function call:
my_list = [1, 2, 5, 7, 6, 5, 6, 3, 4, 1, 0]
print (longest_series_of_neighbours (my_list))
4
Sample output](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F7f9411d4-b052-4158-b8b0-2a2b51a7f8e3%2Fc5f850ac-944a-4c14-8019-5107052de86f%2F80u0qjp_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Given a list of integers, let's decide that two consecutive items in the list are neighbours if
their difference is 1. So, items 1 and 2 would be neighbours, and so would items 56 and
55.
Please write a function named longest_series_of_neighbours, which looks for the
longest series of neighbours within the list, and returns its length.
For example, in the list [1, 2, 5, 4, 3, 4] the longest list of neighbours would be [5,
4, 3, 4], with a length of 4.
An example function call:
my_list = [1, 2, 5, 7, 6, 5, 6, 3, 4, 1, 0]
print (longest_series_of_neighbours (my_list))
4
Sample output
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