leetcode 693. Binary Number with Alternating Bits

原题：

Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.

Example 1:

Input: 5Output: TrueExplanation:The binary representation of 5 is: 101

Example 2:

Input: 7Output: FalseExplanation:The binary representation of 7 is: 111.

Example 3:

Input: 11Output: FalseExplanation:The binary representation of 11 is: 1011.

Example 4:

Input: 10Output: TrueExplanation:The binary representation of 10 is: 1010.

代码如下：

bool hasAlternatingBits(int n) {    int temp=-1;    while(n!=0)    {        if(temp==n%2)        {            return false;        }        else        {            temp=n%2;            n=(n-temp)/2;        }    }    return true;}

这个就说啥了。。