Single Number II

最新推荐文章于 2025-11-28 10:06:43 发布

最新推荐文章于 2025-11-28 10:06:43 发布 · 88 阅读

文章标签：

#runtime

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文介绍了一种算法，用于在给定整数数组中找到仅出现一次的元素，所有其他元素都出现三次。算法运行时间复杂度为线性，并且不使用额外内存。

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?

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