Total Accepted: 14472 Total
Submissions: 44420
Given an array of integers, every element appears three times except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
![dfs深度優先搜尋_圖的深度優先搜尋（DFS）[圖]](data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=)