# LeetCode 0137 - Single Number II

## Contents

# Single Number II

## Desicription

Given a **non-empty** 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:

1 | Input: [2,2,3,2] |

**Example** 2:

1 | Input: [0,1,0,1,0,1,99] |

## Solution

1 | class Solution { |