#include <iostream>
using namespace std;
void clearIthBits(int num, int i) {
int bitMask = (~0) << i;
num = num & bitMask;
cout << num << endl;
}
int main()
{
clearIthBits(15, 2);
return 0;
}
class Solution { public int [] countOppositeParity ( int [] nums ) { // approach 1 - checks every pair int n = n...
No comments:
Post a Comment