Leetcode 137 Single Number II Solution in java | Hindi Coding Community

 

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(int[] nums) {

        int od=0,ans=0,sum=0;

        for(int i=0;i<32;i++){

            sum=0;

            od=0;

            for(int j=0;j<nums.length;j++){

                if((1&nums[j])!=0)od++;

                nums[j]>>=1;

                sum|=nums[j];

            }

            if(od%3!=0) ans|=(1<<i);

            if(sum==0)  break;

        }

        return ans;

    }

}