LeetCode – Single Number II (Java)

Problem

Given an array of integers, every element appears three times except for one. Find that single one.

Java Solution

This problem is similar to Single Number.

public int singleNumber(int[] A) {
    int ones = 0, twos = 0, threes = 0;
    for (int i = 0; i < A.length; i++) {
        twos |= ones & A[i];
        ones ^= A[i];
        threes = ones & twos;
        ones &= ~threes;
        twos &= ~threes;
    }
    return ones;
}

If you want someone to read your code, please put the code inside <pre><code> and </code></pre> tags. For example:

<pre><code> 
String foo = "bar";
</code></pre>

Shailesh Agarwal on 2015-9-28

can you provide the explanation. Looks complicated.
dwaijam on 2016-2-16

Explanation – http://www.careercup.com/question?id=15066700
nagen on 2017-8-19

http://www.geeksforgeeks.org/find-the-element-that-appears-once/

LeetCode – Single Number II (Java)

Related posts:

Leave a comment