You are given an array a consisting of n integers. A subarray (l, r) from array a is defined as non-empty sequence of consecutive elements al, al + 1, ..., ar. The beauty of a subarray (l, r) is calculated as the bitwise AND for all elements in the s
按照自己的理解题目,数组内所有的组合:假如[1,2,3,4]看成1111到0000里面的排列组合,取位运算. vector<vector > subsets(vector&nums) { int S = nums.size(); int N = 1 << S; vector<vector > res; for (int i = 0; i < N; i++) { vector v; for (int j = 0; j < S; ++j) { if (i