find the number which is not repeated in array of integers using modulo method

Confused Cormorant answered on August 13, 2022 Popularity 1/10 Helpfulness 1/10

answer find the number which is not repeated in array of integers using modulo method

find the number which is not repeated in array of integers using modulo method

Comment

int findUnique(int A[], int size) {
  // First we set up a bit vector and initialize it to 0.
  int count[32];
  for (int j=0;j<32;j++) {
    count[j] = 0;
  }

  // Then we go through each number in the list.
  for (int i=0;i<size;i++) {
    int x = A[i];

    // And for each number we go through its bits one by one.
    for (int j=0;j<32;j++) {
      // We add the bit to the total.
      count[j] += x & 1;
      // And then we take it modulo 3.
      count[j] %= 3;
      x >>= 1;
    }
  }

  // Then we just have to reassemble the answer by putting together any
  // bits which didn't appear a multiple of 3 times.
  int answer = 0;
  for (int j=31;j>=0;j--) {
    answer <<= 1;
    if (count[j] == 1) {
      answer |= 1;
    }
  }

  return answer;
}

Popularity 1/10 Helpfulness 1/10 Language whatever

Source: stackoverflow.com

Tags: find modulo using whatever

Link to this answer
Share Copy Link

Contributed on Aug 13 2022

Confused Cormorant

0 Answers Avg Quality 2/10

find the number which is not repeated in array of integers using modulo method

Contents

More Related Answers

find the number which is not repeated in array of integers using modulo method

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.