LeetCode 0137  Single Number II
Contents
Single Number II
Desicription
Given a nonempty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
Example 1:


Example 2:


Solution

