{leetcode}/problems/single-number-ii/[LeetCode - Single Number II^]
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:
Input: [2,2,3,2] Output: 3
Example 2:
Input: [0,1,0,1,0,1,99] Output: 99
由于除了唯一数外，其余数字都出现了三次，那么将每个数字的每位相加，除以 3，余数即为唯一数。
- 一刷
-
link:{sourcedir}/_0137_SingleNumberII.java[role=include]