We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Bit Manipulation
  4. Lonely Integer
  5. Discussions

Lonely Integer

  • emhhacker
     + 0 comments

    My Java solution with o(n) time complexity and constant space:

    public static int lonelyinteger(List<Integer> a) {
        if(a.size() == 1) return a.get(0); //only element available
        
        //use XOR to compare elements
        int res = 0;
        for(int i = 0; i < a.size(); i++) res = a.get(i) ^ res;
        return res;
    }