Leetcode 137 Single Number II Solution in c++ | Hindi Coding Community

0

 

Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it.

You must implement a solution with a linear runtime complexity and use only constant extra space.


Example 1:


Input: nums = [2,2,3,2]

Output: 3

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        int ans=0;
        for(int i=0; i<32; i++){
            int t=0;
            for(int j=0; j<nums.size(); j++){
                t+=(nums[j]&1);
                nums[j]>>=1;
            }
            ans+=((t%3)<<i);
        }
        return ans;
    }
};

Post a Comment

0Comments
Post a Comment (0)

#buttons=(Accept !) #days=(20)

Our website uses cookies to enhance your experience. Learn More
Accept !