#include <iostream>
using namespace std;
int main()
{
//Bitwise operators - One's Complement
cout << (~6) << endl;
cout << (~0) << endl;
return 0;
}
class Solution { public int [] countOppositeParity ( int [] nums ) { // approach 1 - checks every pair int n = n...
No comments:
Post a Comment