notes/OJ notes/pages/Leetcode Single-Number.md
2022-07-22 15:36:57 +08:00

747 B

Leetcode Single-Number

2022-07-22 15:31

Algorithms:

#algorithm #bit_manipulation

Data structures:

#DS #bitset

Difficulty:

#coding_problem #difficulty-easy

Additional tags:

#leetcode

Revisions:

N/A

tag:#bit_manipulation

Problem

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.

You must implement a solution with a linear runtime complexity and use only constant extra space.

Examples

Constraints

Thoughts

[!summary] This is a #template_remove_me

Solution