1.求数组的所有子数组
var subsets = function (nums, target) {
let res = [], len = nums.length;
for (let i = 0; i < (1 << len); i++) {
let arr = [];
for (let j = 0; j < len; j++) {
if (i & (1 << j)) arr.push(nums[j]);
}
res.push(arr);
}
return res;
};
2.求数字的所有连续子数组
var subarraySum = function (nums) {
let res = [];
const subtemp = (arr) => {
for (let start = 0; start < arr.length; ++start) {
let temp = []
for (let end = start; end >= 0; --end) {
temp.unshift(arr[end])
}
console.log(temp)
res.push(temp)
}
}
for(let i=0;i<nums.length;i++){
let temp=nums.slice(i,nums.length)
subtemp(temp)
}
return res;
};
未完待续