天行健，君子以自强不息

题解：从一个数组从寻找只出现一次的数其他只出现两次，位运算的简单题，直接异或运算即可，相同的两个异或运算为0所以最终留下的是只出现一次的那个数 class Solution { public: int singleNumber(vector<int>& nums) { int ones=0; for(int i:nums){ ...

题目： Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one. Note: Your algorithm should have a linear runtime complex...

The gray code is a binary numeral system where two successive values differ in only one bit. Given a non-negative integer n representing the total number of bits in the code, print the sequence of gr...