We define the stretch of a value in a list to be the number of elements between that two leftmost and rightmost values in that list, inclusive. For example, the stretch of 2 in [5, 2, 2, 5, 2] is 4 (from 2, 2, 5, 2). A single value in a list has a stretch of 1. Write a method that returns the maximum stretch found in the input list. Test case 1: maxStretch([8, 5, 1, 2, 3, 4, 5, 10]) = 6 (from 5, 1, 2, 3, 4, 5) Test case 2: maxStretch([2, 7, 1, 2, 3, 7]) = 5 (from 7, 1, 2, 3, 7) For example: Test Result List list = Arrays.aslist(8, 5, 1, 2, 3, 4, 5, 10); 6 System.out.println(maxStretch(list)); List list = Arrays.aslist(2, 7, 1, 2, 3, 7); System.out.println(maxStretch(list)); Answer: (penalty regime: 0 %) Reset answer * Find the largest stretch in a list. * For example, maxStretch([8, 5, 1, 2, 3, 4, 5, 10]) = 6. * @param list is a list of integers. * @return the largest stretch in list. */ public static int maxStretch(List list) { 2 3 4 5 8 10 11 |}

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...
icon
Related questions
Question

using Java language 

We define the stretch of a value in a list to be the number of elements between that two leftmost and rightmost values in that list, inclusive.
For example, the stretch of 2 in [5, 2, 2, 5, 2] is 4 (from 2, 2, 5, 2).
A single value in a list has a stretch of 1.
Write a method that returns the maximum stretch found in the input list.
Test case 1:
maxStretch([8, 5, 1, 2, 3, 4, 5, 10]) = 6 (from 5, 1, 2, 3, 4, 5)
Test case 2:
maxStretch([2, 7, 1, 2, 3, 7]) = 5 (from 7, 1, 2, 3, 7)
For example:
Test
Result
List<Integer> list = Arrays.aslist(8, 5, 1, 2, 3, 4, 5, 10); 6
System.out.println(maxStretch(list));
List<Integer> list = Arrays.aslist(2, 7, 1, 2, 3, 7);
5
System.out.println(maxStretch(list));
Answer: (penalty regime: 0 %)
Reset answer
1
/**
* Find the largest stretch in a list.
* For example, maxStretch([8, 5, 1, 2, 3, 4, 5, 10]) = 6.
* @param list is a list of integers.
* @return the largest stretch in list.
*/
7 public static int maxStretch(List<Integer> list) {
2
3
4
5
6
8
10
11
}
Transcribed Image Text:We define the stretch of a value in a list to be the number of elements between that two leftmost and rightmost values in that list, inclusive. For example, the stretch of 2 in [5, 2, 2, 5, 2] is 4 (from 2, 2, 5, 2). A single value in a list has a stretch of 1. Write a method that returns the maximum stretch found in the input list. Test case 1: maxStretch([8, 5, 1, 2, 3, 4, 5, 10]) = 6 (from 5, 1, 2, 3, 4, 5) Test case 2: maxStretch([2, 7, 1, 2, 3, 7]) = 5 (from 7, 1, 2, 3, 7) For example: Test Result List<Integer> list = Arrays.aslist(8, 5, 1, 2, 3, 4, 5, 10); 6 System.out.println(maxStretch(list)); List<Integer> list = Arrays.aslist(2, 7, 1, 2, 3, 7); 5 System.out.println(maxStretch(list)); Answer: (penalty regime: 0 %) Reset answer 1 /** * Find the largest stretch in a list. * For example, maxStretch([8, 5, 1, 2, 3, 4, 5, 10]) = 6. * @param list is a list of integers. * @return the largest stretch in list. */ 7 public static int maxStretch(List<Integer> list) { 2 3 4 5 6 8 10 11 }
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 5 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY