Given a linked list of 0s, 1s and 2s, sort it.
Input: 2->1->2->1->1->2->0->1->0 Output: 0->0->1->1->1->1->2->2->2 The sorted Array is 0, 0, 1, 1, 1, 1, 2, 2, 2. Input: 2->1->0 Output: 0->1->2 The sorted Array is 0, 1, 2
Method 1: There is a solution discussed in below post that works by changing data of nodes.
Sort a linked list of 0s, 1s and 2s
The above solution does not work when these values have associated data with them.
For example, these three represent three colors and different types of objects associated with the colors and sort the objects (connected with a linked list) based on colors.
Method 2: In this post, a new solution is discussed that works by changing links.
Approach: Iterate through the linked list. Maintain 3 pointers named zero, one, and two to point to current ending nodes of linked lists containing 0, 1, and 2 respectively. For every traversed node, we attach it to the end of its corresponding list. Finally, we link all three lists. To avoid many null checks, we use three dummy pointers zeroD, oneD, and twoD that work as dummy headers of three lists.
Linked List Before Sorting 1 2 0 1 Linked List After Sorting 0 1 1 2
- Time Complexity: O(n) where n is a number of nodes in linked list.
Only one traversal of the linked list is needed.
- Auxiliary Space: O(1).
As no extra space is required.
Please refer complete article on Sort a linked list of 0s, 1s and 2s by changing links for more details!
Please Login to comment...