#include <iostream>
using namespace std;
int main()
{
//Bitwise Shift Operators - Left Shift ( << )
// Note:- a * 2^b
cout << (7 << 2) << endl;
// Bitwise Shift Operatr - Right Shiift ( >> )
// Note:- a/2^b
cout << (7 >> 2) << endl;
return 0;
}
class Solution { public int [] countOppositeParity ( int [] nums ) { // approach 1 - checks every pair int n = n...
No comments:
Post a Comment