0061.出现一次的整数.md

61. 出现一次的整数

题目链接

C

#include<stdio.h>
int main()
{
    int n;scanf("%d",&n);
    int ans=0;
    while(n--)
    {
        int x;scanf("%d",&x);
        ans^=x;
    }
    printf("%d\n",ans);
    return 0;
}

C++

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;cin>>n;
    int ans=0;
    while(n--)
    {
        int x;cin>>x;
        ans^=x;
    }
    cout<<ans<<endl;
    return 0;
}

Java

import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int res = scanner.nextInt();
        for (int i = 1; i < n; i++) {
            res ^= scanner.nextInt();
        }
        System.out.println(res);
    }
}

Python

from collections import Counter

length = int(input())
nums = list(map(int, input().split()))
count = Counter(nums)
for key,value in count.items():
    if value == 1:
        print(key)
        break

JS

Go

package main

import(
    "fmt"
)

func main(){
    var (
        ans int 
        n int
    )
    fmt.Scan(&n);
    for n>0{
        var x int 
        fmt.Scan(&x)
        ans^=x;
        n--;
    }
    fmt.Println(ans);
}