求教一个bit的算法题？

求教一下这个题目~ 是bit的题目吗？我可以想象成给我一个int数组，每个位置存放一个bit位吗？谢谢

Assume you have a binary number 00110010, you apply some function on it and the number changes to some random number 10100011. Write a function to determine which numbers flipped from 0 to 1 and which bits flipped from 1 to 0. (You will have to write 2 different functions for 0 to 1 and 1 to 0).

难道不是从左到右扫一遍对比original和result吗？

austurela 发表于 2014-3-3 14:09
难道不是从左到右扫一遍对比original和result吗？

什么叫which number？ which digit的意思？

original XOR result = changed
changed AND result = 0 to 1
changed AND original = 1 to 0

赞同楼上是对的 既然是bit manipulation的题目 用int至少space就不符合要求