124. Single Number II

MediumBit Manipulation

Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it. You must implement a solution with a linear runtime complexity and use only constant extra space.

Examples

Input: [2,2,3,2]

Output: 3

Explanation: 2 appears three times; 3 appears once.

Constraints

  • 1 <= nums.length <= 3 * 10^4
  • -2^31 <= nums[i] <= 2^31 - 1
  • Each element in nums appears exactly three times except for one element which appears once.
Loading...

Run checks all cases above. Submit evaluates all test cases.