求一个整数是否可以被3整除

1 1 0 0
1 1
1 1 0 0
1 1 0 0
1 0 0 1 0 0

bool IsTimesOf3(int data, int* result){
int num = data < 0 ? -data : data;
int lastBit = 0;
int times = 0;
while(num > 0){   //若结果大于零则一直进行运算，3倍数最终会等于0，不是3倍数最终会小于0
lastBit = num & 1;
num = (num >> 1) - lastBit;
*result |= (lastBit << times);
times++;
}
if (num != 0)
{
*result = 0;
}
return num == 0 ? true : false;
}