please help!

Here is a situation:

Use a single-subscripted array to solve the following problem: Write an applet that inputs 20 numbers, each of which is between 10 and 100, inclusive. As each number is read, display it only if it is not a duplicate of a number already read. Provide the 齱orst case?in which all 20 numbers are different. Use the smallest possible array to solve this problem. The applet should use the GUI techniques introduced in previous lab sessions. Display the results in a JTextArea. Use JTextArea method setText to update the results after each value is input by the user.

[596 byte] By [Dizzyhaa] at [2007-9-29 15:00:34]