bitset C++ python解Leetcode 3133 Minimum Array End

bitset C++ python解Leetcode 3133  Minimum Array End

簡單地說就是把x和n-1的二進位塞成一個數字

-----------

Roughly speeaking, "pack" the binary expressions of x & n-1 into one number

[codes on Leetcode]https://leetcode.com/problems/minimum-array-end/solutions/6024899/bitset-with-o-56-time-beats-100/

[bit/ bit mask playlist]https://www.youtube.com/watch?v=Hw1fnQA8Nk8&list=PLYRlUBnWnd5K8FlzJ6tOswqQcsk7R1Duh