1041 Be Uniquejava

1041 Be Unique (20 分)

Being unique is so important to people on Mars that even their lottery is designed in a unique way. The rule of winning is simple: one bets on a number chosen from [1,10​4​​]. The first one who bets on a unique number wins. For example, if there are 7 people betting on { 5 31 5 88 67 88 17 }, then the second one who bets on 31 wins.

Input Specification:

Each input file contains one test case. Each case contains a line which begins with a positive integer N (≤10​5​​) and then followed by N bets. The numbers are separated by a space.

Output Specification:

For each test case, print the winning number in a line. If there is no winner, print None instead.

Sample Input 1:

7 5 31 5 88 67 88 17

Sample Output 1:

31

Sample Input 2:

5 888 666 666 888 888

Sample Output 2:

None import java.util.Scanner; public class Main { /** * 最后2条数据超时，即使用BufferedReader也会超时，就这尿性 * * */ public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int[] counts = new int[10000+11]; int[] nums = new int[100000+11]; for (int i=0; i<n; ++i) { nums[i] = scanner.nextInt(); counts[nums[i]]++; } int ans=-1; for (int i=0; i<n; ++i) { if (counts[nums[i]]==1) { ans = nums[i]; break; } } if (ans==-1) { System.out.println("None"); } else { System.out.println(ans); } } }