[LeetCode 260] Single Number III

关注

原创最新推荐文章于 2026-03-07 15:12:31 发布 1w 阅读 AI 写同款· GEO 优化 ›

Amos实战：如何用Bootstrap法检验中介效应？附完整操作步骤本文详细介绍了如何使用Amos软件通过Bootstrap法检验中介效应，包括模型设定、参数配置和结果解读。Bootstrap方法因其不依赖正态分布假设、统计功效高等优势，成为中介效应分析的首选方法。文章提供了完整的操作步骤和实用建议，帮助研究者准确评估变量间的中介作用机制。阅读详情

Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.

For example:

Given nums = [1, 2, 1, 3, 2, 5], return [3, 5].

Note:

The order of the result is not important. So in the above example, [5, 3] is also correct.
Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?

Solution:

1. Use XOR to store the difference among these numbers, if XOR all elements, the result is the difference between two number like result = 3^5

then 3^result = 5 , 5^ result = 3

2. Find one digit 1 in the result, which can be used to distinguish 3 and 5. depends on this, XOR elements will be equal to 3^result = 5 , 5^ result = 3

O(n) use constant space

public int[] singleNumber(int[] nums) {
        int[] res = new int[2];
        int result = nums[0];
        for(int i=1;i<nums.length;i++){
        	result = result^nums[i];
        }
        res[0] = 0;
        res[1] = 0;
        int n = result & (~(result-1));
        for(int i=0;i<nums.length;i++){
            if((n & nums[i])!=0){
                res[0] = res[0] ^ nums[i];
            }else {
                res[1] = res[1] ^ nums[i];
            }
        }
        return res;
    }

收录于