All Downloads are FREE. Search and download functionalities are using the official Maven repository.

g0101_0200.s0137_single_number_ii.readme.md Maven / Gradle / Ivy

There is a newer version: 1.24
Show newest version
137\. Single Number II

Medium

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.

**Example 1:**

**Input:** nums = [2,2,3,2]

**Output:** 3 

**Example 2:**

**Input:** nums = [0,1,0,1,0,1,99]

**Output:** 99 

**Constraints:**

*   1 <= nums.length <= 3 * 104
*   -231 <= nums[i] <= 231 - 1
*   Each element in `nums` appears exactly **three times** except for one element which appears **once**.




© 2015 - 2024 Weber Informatics LLC | Privacy Policy