Question

Part 1: Finding the middle item

Given a sorted list of integers, output the middle integer. A negative number indicates the end of the input (the negative number is not a part of the sorted list). Assume the number of integers is always odd.

Ex: If the input is: 2 3 4 8 11 -1
the output is: Middle item: 4

The maximum number of list values for any test case should not exceed 9. If exceeded, output "Too many numbers".

Hint: First read the data into an array. Then, based on the array's size, find the middle item.

-------------------------------------------

Part 2: Reverse

Write a program that reads a list of integers, and outputs those integers in reverse. The input begins with an integer indicating the number of integers that follow. For coding simplicity, follow each output integer by a comma, including the last one. Assume that the list will always contain less than 20 integers.

Ex: If the input is: 5 2 4 6 8 10
the output is: 10,8,6,4,2

To achieve the above, first read the integers into an array. Then output the array in reverse.

Answer 1

Part 1 :

----------------------

class middle_item

{

static Node head;

class Node

{

int data;

Node next;

public Node(Node next, int data)

{

this.data = data;

this.next = next;

}

}

void printMiddle(Node head)

{

int count = 0;

Node mid = head;

while (head != null)

{

if ((count % 2) == 1)

mid = mid.next;

++count;

head = head.next;

}

if (mid != null)

System.out.println("The middle element is [" + mid.data + "]\\");

}

void push(Node head_ref, int new_data)

{

Node new_node = new Node(head_ref,new_data);

head = new_node;

}

void printList(Node head)

{

while (head != null)

{

System.out.print(head.data + "-> ");

head = head.next;

}

System.out.println("null");

}

public static void main(String[] args)

{

middle_item ll = new middle_item();

for(int i = 5; i > 0; i--)

{

ll.push(head, i);

ll.printList(head);

ll.printMiddle(head);

}

}

}

******************************************************************************************

PART 2 :

----------------

import java.util.Scanner;

class ReverseNumberWhile

{

public static void main(String args[])

{

int num=0;

int reversenum =0;

System.out.println("Input your number and press enter: ");

Scanner in = new Scanner(System.in);

num = in.nextInt();

while( num != 0 )

{

reversenum = reversenum * 10;

reversenum = reversenum + num%10;

num = num/10;

}

System.out.println("Reverse of input number is: "+reversenum);

}

}