Cerinta completa

Given an array of integers, where all elements but one occur twice, find the unique element.

Example

The unique element is .

Function Description

Complete the lonelyinteger function in the editor below.

lonelyinteger has the following parameter(s):

  • int a[n]: an array of integers

Returns

  • int: the element that occurs only once

Input Format

The first line contains a single integer, , the number of integers in the array.
The second line contains space-separated integers that describe the values in .

Constraints

  • It is guaranteed that is an odd number and that there is one unique element.
  • , where .

Sample Input 0

1
1

Sample Output 0

1

Explanation 0

There is only one element in the array, thus it is unique.

Sample Input 1

3
1 1 2

Sample Output 1

2

Explanation 1

We have two ‘s, and is unique.

Sample Input 2

5
0 0 1 2 1

Sample Output 2

2

Explanation 2

We have two ‘s, two ‘s, and one . is unique.

Limbajul de programare folosit: java8

Cod:

import java.util.Arrays;
import java.util.Scanner;

public class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		int[] a = new int[n];
		for (int i = 0; i < a.length; i++) {
			a[i] = sc.nextInt();
		}
		System.out.println(solve(a));

		sc.close();
	}

	static int solve(int[] a) {
		return Arrays.stream(a).reduce((x, y) -> x ^ y).getAsInt();
	}
}

Scor obtinut: 1.0

Submission ID: 464603489

Link challenge: https://www.hackerrank.com/challenges/lonely-integer/problem

Lonely Integer