Integer numLengths is read from input. Then, numLengths integers are read from input and inserted at the end of lengthList. If an element is at an even index in lengthList, negate the element. Ex: If the input is: 2 49 33 then the output is: -49 33 Note: Index i is even if i % 2 == 0.
Integer numLengths is read from input. Then, numLengths integers are read from input and inserted at the end of lengthList. If an element is at an even index in lengthList, negate the element. Ex: If the input is: 2 49 33 then the output is: -49 33 Note: Index i is even if i % 2 == 0.
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 16PE:
The implementation of a queue in an array, as given in this chapter, uses the variable count to...
Related questions
Question
New JAVA code can only be added in between the grey lines of code (or lines 15 to 17, as shown in image).
Transcribed Image Text:Note: Index i is even if i % 2 == 0.
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23 }
}
ArrayList<Integer> lengthList
int numLengths;
int i;
=
new ArrayList<Integer>();
numLengths = scnr.nextInt ();
for (i = 0; i < numLengths; ++i) {
lengthList.add (scnr.nextInt());
System.out.println();
}
/* Your code goes here */
for (i = 0; i< lengthList.size(); ++i) {
System.out.print(lengthList.get(i) + ");
F
}
![Integer numLengths is read from input. Then, numLengths integers are read from input and inserted at the end of lengthList. If an
element is at an even index in lengthList, negate the element.
Ex: If the input is:
2
49 33
then the output is:
-49 33
Note: Index i is even if i % 2 == 0.
1 import java.util.Scanner;
2 import java.util.ArrayList;
T
N345698
4 public class LengthListModification {
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
7
10
HNM
11
---
12
13
14
15
16
17
18
ArrayList<Integer> lengthList = new ArrayList<Integer>();
int numLengths;
int i;
numLengths = scnr.nextInt ();
for (i = 0; i < numLengths; ++i) {
lengthList.add(scnr .nextInt());
}
/* Your code goes here */
for (i = A. i < lenothlist size(): ++i) {](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F0cc153ae-b205-4fb2-9991-7cf6a21d5016%2F719290fe-9f6e-4384-b51b-8171d5ddbf7d%2Fr4ix2on_processed.png&w=3840&q=75)
Transcribed Image Text:Integer numLengths is read from input. Then, numLengths integers are read from input and inserted at the end of lengthList. If an
element is at an even index in lengthList, negate the element.
Ex: If the input is:
2
49 33
then the output is:
-49 33
Note: Index i is even if i % 2 == 0.
1 import java.util.Scanner;
2 import java.util.ArrayList;
T
N345698
4 public class LengthListModification {
public static void main (String[] args) {
Scanner scnr = new Scanner(System.in);
7
10
HNM
11
---
12
13
14
15
16
17
18
ArrayList<Integer> lengthList = new ArrayList<Integer>();
int numLengths;
int i;
numLengths = scnr.nextInt ();
for (i = 0; i < numLengths; ++i) {
lengthList.add(scnr .nextInt());
}
/* Your code goes here */
for (i = A. i < lenothlist size(): ++i) {
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 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