☑Kizspy.me
·
void addLast(String xDesert, int xStep, int xType) - check if xDesert.charAt(0) == 'B' then do
nothing, otherwise add new node with desert-xDesert, step-xStep, type=xType to the end of the
list. (step and type can get arbitrary, even negative values).
void f1() - Do not edit this method. Your task is to complete the addLast(...) method above only.
Output in the file f1.txt must be the following:
(A,9,8) (C,6,5) (D,2,4) (E,7,9) (F,4,-7) (G,-3,2)
.
void f2()-There are 3 given Camel objects x, y, z in this function. Write statements to insert x,
y and z to the list so that x, y, z will be at positions 2, 4 and 5 (The head's position is 0). Output in
the file f2.txt must be the following:
(C,9,8) (D,6,3) (E,8,5) (F,5,4) (1,4,9) (J,3,7)
(C,9,8) (D,6,3) (X,1,2) (E,8,5) (Y,2,3) (Z,3,4) (F,5,4) (1,4,9) (J,3,7)
Zoom
1
void f3()-Suppose p is the first node having maximum step in the list. Find the second node q
having q.info.step<p.info.step. Swap the contents of p and q. Output in the file f3.txt must be the
following:
(C,7,6) (D,6,7) (E,3,8) (F,7,9) (G,8,7) (H,4,9) (1,8,3) (J,5,4)
(C,7,6) (G,8,7) (E,3,8) (F,7,9) (D,6,7) (H,4,9) (1,8,3) (J,5,4)
+100%
Close
