Given a linked list containing 0s,1s or 2s. Sort it.
Solution:
Maintain three different linked lists each having its own start pointer (LL0, LL1, LL2) and keep adding the elements to the respective lists.
After the traversal you have three linkedlists (LL0, LL1 and LL2), now just join LL1 to the end of LL0 and LL2 to the end of LL1.
Another approach:
Keep three counters (c0,c1 and c2) and in the end reset the linked list elements as per the counters.
http://www.geeksforgeeks.org/archives/23088
Solution:
Maintain three different linked lists each having its own start pointer (LL0, LL1, LL2) and keep adding the elements to the respective lists.
After the traversal you have three linkedlists (LL0, LL1 and LL2), now just join LL1 to the end of LL0 and LL2 to the end of LL1.
Another approach:
Keep three counters (c0,c1 and c2) and in the end reset the linked list elements as per the counters.
http://www.geeksforgeeks.org/archives/23088
No comments:
Post a Comment