Write a method has Twoconsecutive that returns whether or not a list of integers has two adjacent numbers that are consecutive integers ( true if such a pair exists and false otherwise). For example, if a variable 1ist stores the following sequence of values, then the call 11st.hasTwoconsecutive() should return true because the list contains the adjacent numbers (7, 8) which are a pair of consecutive numbers:
Write a method has Twoconsecutive that returns whether or not a list of integers has two adjacent numbers that are consecutive integers ( true if such a pair exists and false otherwise). For example, if a variable 1ist stores the following sequence of values, then the call 11st.hasTwoconsecutive() should return true because the list contains the adjacent numbers (7, 8) which are a pair of consecutive numbers:
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Java
![You are given a solution to the following problem:
Write a method hasTwOconsecutive that returns whether or not a list of integers has two adjacent
numbers that are consecutive integers ( true if such a pair exists and false otherwise). For example,
if a variable 1ist stores the following sequence of values, then the
call 1ist.hasTwoconsecutive() should return true because the list contains the adjacent numbers (7,
8) which are a pair of consecutive numbers:
[1, 18, 2, 7, 8, 39, 18, 40]
If the list had stored the following sequence of values, then the method should return false
[1, 18, 17, 2, 7, 39, 18, 40, 8]
This sequence contains some pairs of numbers that could represent consecutive integers (e.g., 1 and
2,7 and 8, 39 and 40), but those pairs of numbers are not adjacent in the sequence. The list also has
a pair of adjacent numbers (18, 17) that are not in the right order to be considered consecutive. You
may not make any assumptions about how many elements are in the list.
Assume that this method is part of the LinkedIntlist class as defined below:
public class LinkedIntlist {
private ListNode front;
// null for an empty list
Correct the errors in the solution below and rewrite the working version
public static boolean hasTwoConsecutive({
if (front==null ) return false;
else {
ListNode cur=front;
while(cur!=null){
if ((cur.data-cur.next.data)==1) return true;
}
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F26e509f6-d35a-44c9-95ba-d273bdf29c4f%2F5a6d2d2e-4500-4530-80ca-33c255ec8a5a%2F8d280p_processed.jpeg&w=3840&q=75)
Transcribed Image Text:You are given a solution to the following problem:
Write a method hasTwOconsecutive that returns whether or not a list of integers has two adjacent
numbers that are consecutive integers ( true if such a pair exists and false otherwise). For example,
if a variable 1ist stores the following sequence of values, then the
call 1ist.hasTwoconsecutive() should return true because the list contains the adjacent numbers (7,
8) which are a pair of consecutive numbers:
[1, 18, 2, 7, 8, 39, 18, 40]
If the list had stored the following sequence of values, then the method should return false
[1, 18, 17, 2, 7, 39, 18, 40, 8]
This sequence contains some pairs of numbers that could represent consecutive integers (e.g., 1 and
2,7 and 8, 39 and 40), but those pairs of numbers are not adjacent in the sequence. The list also has
a pair of adjacent numbers (18, 17) that are not in the right order to be considered consecutive. You
may not make any assumptions about how many elements are in the list.
Assume that this method is part of the LinkedIntlist class as defined below:
public class LinkedIntlist {
private ListNode front;
// null for an empty list
Correct the errors in the solution below and rewrite the working version
public static boolean hasTwoConsecutive({
if (front==null ) return false;
else {
ListNode cur=front;
while(cur!=null){
if ((cur.data-cur.next.data)==1) return true;
}
}
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 4 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY