I'm trying to flatten nested arrays while preserving the order, e.g. [[1, 2], 3, [4, [[5]]]] should be converted to [1, 2, 3, 4, 5].
I'm trying to use recursion in order to do so, but the code below does not work and I don't understand why. I know there are other methods to do it, but I'd like to know what's wrong with this.
function flatten (arr) {
var newArr = [];
for (var i = 0; i < arr.length; i++) {
if (Array.isArray(arr[i])) {
flatten(arr);
} else {
newArr.push(arr[i]);
}
}
return newArr;
}
flatten([[1, 2], 3, [4, [[5]]]]);
Thanks
-
5What is the steamroller function?AnthonyDJ– AnthonyDJ2015年06月01日 20:11:52 +00:00Commented Jun 1, 2015 at 20:11
-
Sorry, it's one of the freecodecamp challenges and I changed the name for something more descriptive, but I forgot that one. That's not the issue though.user1576121– user15761212015年06月01日 20:18:19 +00:00Commented Jun 1, 2015 at 20:18
-
See my recursive version of array flattening in this stackoverflow pageSandro Rosa– Sandro Rosa2021年04月18日 08:20:21 +00:00Commented Apr 18, 2021 at 8:20
7 Answers 7
When calling flatten recursively, you need to pass arr[i] to it and then concat the result with newArr. So replace this line:
flatten(arr);
with:
newArr = newArr.concat(flatten(arr[i]));
Comments
Here's a common pattern that I regularly use for flattening nested arrays, and which I find a bit more clean due to its functional programming nature:
var flatten = (arrayOfArrays) =>
arrayOfArrays.reduce((flattened, item) =>
flattened.concat(Array.isArray(item) ? flatten(item) : [item]), []);
Or for those who like a shorter, less readable version for code golf or so:
var flatten=a=>a.reduce((f,i)=>f.concat(Array.isArray(i)?flatten(i):[i]),[]);
1 Comment
Array.isArray(item) ? flatten(item) : [item]: [item] should be item => Array.isArray(item) ? flatten(item) : itemHere is some working code
function flatten (arr) {
var newArr = [];
for (var i = 0; i < arr.length; i++) {
if (Array.isArray(arr[i])) {
var temp = flatten(arr[i]);
temp.forEach(function(value){ newArr.push(value); })
} else {
newArr.push(arr[i]);
}
}
return newArr;
}
Comments
Havent tested it, bit this part
if (Array.isArray(arr[i])) {
flatten(arr);
} else {
Seems to be intended as
if (Array.isArray(arr[i])) {
flatten(arr[i]);
} else {
3 Comments
This solution is without using any Array methods
//1 >> loop inside parent
//2 >> if the element is not an array then push it in array that has to be returned or else loop inside it
const arr = [[0, 1], [2, 3], [4, 5, [6, 7, [8, [9, 10]]]]]
function toFlatArray(arr) {
let flatArray = [];
function rec(a) {
if (!Array.isArray(a)) {
flatArray.push(a);
} else {
for (let i = 0; i < a.length; i++) {
rec(a[i]);
}
}
}
rec(arr);
return flatArray;
}
const flatArray = toFlatArray(arr);
console.log("flatArray", flatArray);
1 Comment
Easy to understand solution:
var flatten = function(array) {
let flatArray = [];
array.forEach(element => {
if (Array.isArray(element)) {
let inner = flatten(element);
flatArray.push(...inner)
} else {
flatArray.push(element);
}
})
return flatArray;
};
Comments
Recursive Solution!
let newArray = [];
function arrayFlat(array){
for(let i = 0; i< array.length; i++){
if(!array[i].length) { newArray.push(array[i])};
arrayFlat(array[i]);
}
console.log(newArray);
}
arrayFlat(arrayData);
// Array to be flattened.
arrayData = [1,2,[3,4],[[5,6],7]];