137. Single Number II

原创于 2019-01-15 20:43:07 发布 · 304 阅读

0 ·

CC 4.0 BY-SA版权

Leet Code 专栏收录该内容

143 篇文章

订阅专栏

本文介绍了一种解决LeetCode题目137的算法，即在一个每个元素出现三次，仅有一个元素出现一次的整数数组中找到这个唯一的元素。算法采用位操作，实现了线性时间复杂度，并且不使用额外内存，符合题目的要求。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

137. Single Number II

Medium

655224FavoriteShare

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

class Solution {
    public int singleNumber(int[] nums) {
        int sum = 0;
        for (int i = 0; i < 32; i++) {
            int bit = 0;
            for (int j = 0; j < nums.length; j++) {
                bit += (nums[j] >> i) & 1;
                bit %= 3;
            }
            
            sum |= (bit << i);
        }
        
        return sum;
    }
}