void addLast(String xOwner, int xHorn, int xColor) - check if xOwner.charAt(0) == 'A' then do nothing, otherwise add new node with owner=xOwner, horn=xHorn, color=xColor to the end of the list. (horn and color 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:
(B,5,3) (C,6,5) (D,2,4) (E,7,9) (F,4,-7) (G,-3,2)
void f2()-There are 3 given Cala objects x, y, z in this function. Suppose the list contains at least 3 elements. Write statements to insert x, y and z to the list so that x, y, z will be at positions 1, 4 and 6 (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) (1,3,7)
(C,9,8) (X,1,2) (D,6,3) (E,8,5) (1,2,3) (F,5,4) (2,3,4) (1,4,9) (1,3,7)
1
void f3() - Suppose p is the first node having maximum color in the list. Swap the contents of tail and p (thus if p=tail then do nothing). 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)
(C,7,6) (D,6,7) (E,3,8) (1,8,3) (G,8,7) (H,4,9) (F,7,9)
+ 100%
Zoom
Close
