【LeetCode每日打卡】136. 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

来源：力扣（LeetCode） 链接：https://leetcode-cn.com/problems/single-number 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

经典位运算题目

JAVA

class Solution {
    public int singleNumber(int[] nums) {
        for(int i=1;i<nums.length;i++)
            nums[i] ^= nums[i-1];
        return nums[nums.length-1];
    }
}

早睡早起 身体好