姚军

题目 类型：位运算 难度：简单 注意：IP可能超过int需要用无符号整型，并且牛客的判题系统while中的scanf必须要不等于EOF不然会出错。 #include <cstdio> #include <iostream> #include <cstring> using namespace std; int main(){ unsigned int...

x&-x 常用在树状数组中 class Solution { public: bool isPowerOfTwo(int n) { return n > 0 && (n & -n) == n; } };

位运算+模拟 class Solution { public: int countPrimeSetBits(int L, int R) { unordered_set<int> primes({2, 3, 5, 7, 11, 13, 17, 19}); int res = 0; for(int i = L; i <= R;...

class Solution { public: //a ^ a = 0 //0 ^ a = a int singleNumber(vector<int>& nums) { int res = 0; for(auto x: nums){ res ^= x; } ...

class Solution { public: int findComplement(int num) { int res = 0, t = 0; while(num){ res += !(num &1) << t; //如果是0则取反后把1右移t位 num >>= 1; ...

大神代码 class Exchange { public: int exchangeOddEven(int x) { int oddVal = (x & 0xAAAAAAAA); // bit 1 3 5 ... 31 int evenVal = (x & 0x55555555); // bit 0 2 4 ... 30 re...

class Transform { public: int calcCost(int x, int y) { string a = bitset<32>(x).to_string(); string b = bitset<32>(y).to_string(); int cnt = 0; for(int i =...

x^x = 0 0^x = x 异或位运算 #include <cstdio> #include <iostream> #include <vector> #include <string> #include <algorithm> using namespace std; int main(){ int m, n; cin>&...

#include <cstdio> #include <iostream> #include <vector> #include <string> #include <bitset> #include <algorithm> using namespace std; int main(){ int x; cin>&g...