Linked List nested Object
Input Should be like this
var ii = {"val":"1","next":{"val":"2","next":{"val":"3","next":{"val":"4","next":{"val":"5","next":null}}}}};
Output should be like [1,2,3,4,5]
-
Cool. So, what did you try so far?Mike 'Pomax' Kamermans– Mike 'Pomax' Kamermans2018-05-12 09:56:54 +00:00Commented May 12, 2018 at 9:56
-
var results = ii.forEach(function(obj){ cc(obj.next) }); function cc(req){ arr.push(req.val) }Chandan Kumar– Chandan Kumar2018-05-12 09:58:06 +00:00Commented May 12, 2018 at 9:58
-
i'm not getting exact resultChandan Kumar– Chandan Kumar2018-05-12 09:58:48 +00:00Commented May 12, 2018 at 9:58
-
1Please update your question to show what you tried, why you tried that, and why it didn't work the way you thought it would. Explaining your idea on how to solve this problem helps everyone else in explaining where your approach broke down.Mike 'Pomax' Kamermans– Mike 'Pomax' Kamermans2018-05-12 10:00:33 +00:00Commented May 12, 2018 at 10:00
-
Without showing any attempt then this looks like "homework". In fact it's the sort of thing we could look at and not really see any "practical usage" and therefore deduce it to in fact be a homework assignment. Whilst there is no "specific rule" against posting homework here, it's not really what a teacher intends when they hand out such work. You'd get more out of it thinking through solving the problem than simply receiving somebody elses answer in order to meet an assignment grade.Neil Lunn– Neil Lunn2018-05-12 10:19:40 +00:00Commented May 12, 2018 at 10:19
Add a comment
|
3 Answers
Solution
var ii = { "val": "1", "next": { "val": "2", "next": { "val": "3", "next": { "val": "4", "next": { "val": "5", "next": null } } } } };
var arr = [ii.val]
while(ii.next !== null){
ii = ii.next;
arr.push(ii.val)
}
console.log(arr)
Comments
A little fancier demonstrating a recursive function call, as may have been the point of the exercise and utilizing Array.reduce().
var ii = {
"val":"1", "next":{
"val":"2", "next":{
"val":"3", "next":{
"val":"4", "next":{ "val":"5", "next":null }
}
}
}
};
const process = obj => {
const remap = (acc,[k,v]) => ([
...acc,
...(( k === 'val') ? v : (v === null)
? [] : Object.entries(v).reduce(remap,[]))
]);
return Object.entries(obj).reduce(remap,[]);
};
console.log(process(ii));Whist fancy, it's not as efficient. So still keeping with "non destructive" you can take a clone of the object and still recurse:
var ii = {
"val":"1", "next":{
"val":"2", "next":{
"val":"3", "next":{
"val":"4", "next":{ "val":"5", "next":null }
}
}
}
};
const process = obj => (({ val, next }) =>
[ val, ...((next !== null) ? process(next): []) ])(obj);
console.log(process(ii));Even cleaner and effectively just as fast as the while, and of course "non-destructive" to the original content since it's all locally scoped.
Comments
You can create an empty array and push the data into it while going through the list. I am using JavaScript to solve your problem.
let ii = {"val":"1","next":{"val":"2","next":{"val":"3","next":{"val":"4","next":{"val":"5","next":null}}}}};
let array = [];
//Your linked list
let head = ii;
//Until the list data reaches null continue doing the codes below
while(head !== null){
//Get the data from list and push it into your array.
array.push(head.val);
//after pushing data move to the next list by changing head position
head = head.next;
}
//return the array after all data is pushed in
return array;
