How to get all subarrays from an array by using JavaScript All In One
JavaScript 动态生成其所有的
子数组
算法
difficulty: Medium
/ 难度: 中等
solutions
demos
// 双指针 ???// function numberOfSubarrays(nums: number[], k: number): number {
// let count = 0;
// // sub-arrays
// const subarrays = getAllSubarrays(nums);
// for(let subarray of subarrays) {
// let odds = subarray.filter(i => i % 2 !== 0);
// if(odds.length === k) {
// count++;
// }
// }
// return count;
// };// 滑动 ❌
// function getAllSubarrays(arr: number[]): number[][] {
// let result: number[][] = [];
// let len = arr.length;
// while(len) {
// let temp = [];
// let step = arr.length - len + 1;
// console.log(`❓ step =`, step)
// for(let i = 0; i <= arr.length; i++) {
// if(arr[step]) {
// temp.push(arr.slice(i, step));
// result.push(temp);
// }
// step++;
// }
// console.log(`❌ result =`, result);
// len--;
// }
// console.log(`result =`, result);
// return result;
// };// 递归: 排列组合 permutation & composition
// function getAllPermutation(arr: number[]): number[][] {
// let result: number[][] = [];
// for(let i = 0; i < arr.length; i++) {
// let temp = arr[i];
// let others = getAllPermutation([...arr.slice(0, i), ...arr.slice(i)]);
// for(let other of others) {
// result.push([temp, ...other]);
// }
// }
// return result;
// };
https://leetcode.com/problems/count-number-of-nice-subarrays/?envType=daily-question&envId=2024-06-22
(🐞 反爬虫测试!打击盗版⚠️)如果你看到这个信息, 说明这是一篇剽窃的文章,请访问 https://www.cnblogs.com/xgqfrms/ 查看原创文章!
subarray vs subsequence vs subset
子数组
子序列
子集合
https://www.geeksforgeeks.org/array-subarray-subsequence-and-subset/
MDN
https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array?ref=blog.xgqfrms.xyz
https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray/subarray
refs
https://www.geeksforgeeks.org/generating-subarrays-using-recursion/
©xgqfrms 2012-2021
www.cnblogs.com/xgqfrms 发布文章使用:只允许注册用户才可以访问!
原创文章,版权所有©️xgqfrms, 禁止转载 🈲️,侵权必究⚠️!