【LeetCode】693. Binary Number with Alternating Bits

题目：

思路：将数字转化为二进制存入数组，依次比较即可

代码：

#include <iostream>  
#include <vector>
#include <array>
#include <string>
using namespace std;

class Solution {
public:
    bool hasAlternatingBits(int n) {
        vector<int> res;
		while(n > 0){
			res.push_back(n % 2);
			n = n / 2;
		}
		for(int i = 0; i <  res.size() - 1;i++){
			if(res[i] == res[i+1])
				return false;
		}
		return true;
    }
};
int main(){
        Solution so; 
		int n = 7;
		cout << so.hasAlternatingBits(n) << endl;
        system("pause");  
        return 0;  
}