leetcode Bit Manipulation

本文介绍了一种使用位操作解决问题的方法,具体为在一个整数数组中找到仅出现一次的整数,而其他元素均出现两次或三次。算法具备线性时间复杂度且不使用额外内存,适用于SingleNumber I和II两种情况。

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

Bit Manipulation, work from latched

Single Number I

Given an array of integers, every element appears twice except for one. Find that single one.

Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

Note : not use python build in set function, which can return unique number in the list


class Solution:
    # @param A, a list of integer
    # @return an integer
    def singleNumber(self, A):
        x = 0
        for numbers in A:
            x=x^numbers
        return x



Single Number II

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?

class Solution {
public:
    int singleNumber(int A[], int n) {
        int oneNum = 0;
        int twoNum = 0;
        int threeNum = 0;
        for(int i = 0 ; i < n ;i++){
            threeNum = twoNum & A[i];
            twoNum = oneNum & A[i] | twoNum;
            oneNum = oneNum | A[i];
            oneNum = oneNum &(~threeNum);
            twoNum = twoNum & (~threeNum);
            threeNum = 0;
        }
        return oneNum;
    }
};


Summary :  or operation to get 1, and operation to accumulate 1, and (not) to clear.

This method can be extend for more case for question like single number


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值