Bitwise Operation, Add one to a number without using +

Question

Anonimo · Accepted Answer

int add (int n) { return n & 1 ? add (n>>1)<<1 : n | 1; } First expression in the ternary operator is carrying the 1 if the last binary digit is one, the second is adding the 1 if the last binary digit is 0

Anonimo · Answer

-(~x)

To simulate an adder · Answer

#include 
#include 

using namespace std;

int AddOne(int N);

int main()
{
  srand(0);
  int N = 0;
  for (int i=0; i0)
    {
      Temp = (CarryIn & N) & One[bitI++];
      N = (N ^ CarryIn);
      CarryIn = Temp << 1;
    }
    return N;
}
Ironically, although the "+" is not applied to the number, the iteration index is incremented.

Two Sigma

Domanda di colloquio di Two Sigma

Risposte di colloquio

Aziende seguite

Ricerche di lavoro