Leetcode 136. Single number && 137. Single number II

Source: Internet
Author: User

Given an array of integers, every element appears twice except for one. Find the single one.

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

XOR Computing Applications:

The XOR operation satisfies the commutative law and the binding law, and the same element can be adjacent by exchanging elements (such as insertion sort, etc.).

(x, x), (y, y), ..., Sigle, ..., (Z, z)

All elements xor: (x ^ x) ^ ... ^ single ^ (z ^ z) = 0 ^ ... ^ single ^ ... ^ 0 = single

1 intSinglenumber (intA[],intN)2     {3         intSingle =0;4         5          for(inti =0; I < n; i++)6Single ^=A[i];7         8         returnSingle ;9}

Leetcode 136. Single number && 137. Single number II

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.