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

XOR prefix sum C++ python解Leetcode 1829 Maximum XOR for Each Query

XOR prefixsum CPP python解Leetcode 1829  Maximum XOR for Each Query

其實這裡考慮的是元素個數為2^maximumBit的交換群，運算子為XOR。

[Python code請進]

2 pointer Python C++解Leetcode 3163 String Compression III

2 pointer Python C++解Leetcode 3163  String Compression III

[codes on Leetcode]https://leetcode.com/problems/string-compression-iii/solutions/6004059/string-with-2-pointers-3ms-beats-99-15/

[2-pointer/Sliding window play list]https://www.youtube.com/watch?v=--IlX3x54nk&list=PLYRlUBnWnd5KrCfs7qCFb-Bvn7dvnakFy