LeetCode 136. Single Number

分析

难度 易

来源

https://leetcode.com/problems/single-number

题目

Given a non-empty array of integers, every element appears twice except for one. Find that single one.

Note:

Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

Example 1:

Input: [2,2,1]

Output: 1

Example 2:

Input: [4,1,2,1,2]

Output: 4

解答

package LeetCode;

public class L136_SingleNumber {
    public int singleNumber(int[] nums) {
        int result=0;
        for(int i=0;i<nums.length;i++){
            result^=nums[i];
        }
        return result;
    }
    public static void main(String[] args){
        L136_SingleNumber l136=new L136_SingleNumber();
        //int[] nums={2,2,1};
        int[] nums={4,1,2,1,2};
        System.out.println(l136.singleNumber(nums));
    }
}