info@onlinelearningcenter.in (+91) 7 999 01 02 03 Get started with 60 Hours of Free course right now 

Find the only 1 non-repeating number

Suraj Ghimire
40 Posts

Given a non-empty 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?

Example 1:

Input: [2,2,1]
Output: 1

Example 2:

Input: [4,1,2,1,2]
Output: 4


class Solution {
    public int singleNumber(int[] nums) {
        int num=0;
       for(int i=0;i<nums.length;i++){
            num=nums[i];
           int count=0;
           for(int j=0;j<nums.length;j++){
               if(nums[j]==num)count++;
           }
           if(count==1){
              break;
           }
       }
        return num;
    }
}
Published By : Suraj Ghimire
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Comments