-
Notifications
You must be signed in to change notification settings - Fork 0
/
Tri-Partition.c
136 lines (117 loc) · 2.63 KB
/
Tri-Partition.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
#include <stdio.h>
#include <stdlib.h>
struct _listNode{
int item;
struct _listNode* next;
};
typedef struct _listNode ListNode;
void printList(ListNode *head);
void deleteList(ListNode **ptrHead);
int insertNode(ListNode **ptrHead, int item);
void triPartition(ListNode** head, int pivot);
int main()
{
ListNode *head = NULL, *temp;
int i = 0;
int pivot = 0;
scanf("%d",&pivot);
while (scanf("%d", &i)){
if (head == NULL){
head = (ListNode*) malloc(sizeof(ListNode));
temp = head;
}
else{
temp->next = (ListNode*) malloc(sizeof(ListNode));
temp = temp->next;
}
temp->item = i;
}
temp->next = NULL;
triPartition(&head, pivot);
printList(head);
deleteList(&head);
return 0;
}
void printList(ListNode *head){
while(head !=NULL){
printf("%d ",head->item);
head = head->next;
}
printf("\n");
}
void deleteList(ListNode **ptrHead){
ListNode *cur = *ptrHead;
ListNode *temp;
while (cur!= NULL) {
temp=cur->next;
free(cur);
cur=temp;
}
*ptrHead=NULL;
}
int insertNode(ListNode **ptrHead, int item){
ListNode *pre = *ptrHead, *newNode;
// If empty list or inserting first node, update head pointer
if (*ptrHead == NULL){
newNode = malloc(sizeof(ListNode));
newNode->item = item;
newNode->next = NULL;
*ptrHead = newNode;
return 1;
}
// Find the nodes before and at the target position
//applies only to insert at last node
else
{
while(pre->next)
{
pre = pre->next;
//printf("last\n");
} //pre is the last node
newNode = malloc(sizeof(ListNode));
newNode->item = item;
newNode->next = NULL;
pre->next = newNode;
return 1;
}
return 0;
}
void triPartition(ListNode** head, int pivot){
// Write your code here
ListNode *cur = *head;
ListNode *less=NULL, *more=NULL;
//count how many element same as pivot
int same = 0;
while(cur)
{
if (cur->item == pivot)
{
same++;
}
else if (cur->item < pivot)
{
insertNode(&less, cur->item);
}
else
{
insertNode(&more, cur->item);
}
cur = cur->next;
}
ListNode *curL = less, *curM = more;
while(curL->next) curL = curL->next;
//starting from less list, add nodes same as pivot
for(int count=1; count<=same; count++)
{
insertNode(&less, pivot);
curL = curL->next;
}
//add nodes more than pivot
while(curM)
{
insertNode(&less, curM->item);
curM = curM->next;
}
*head = less;
printList(*head);
}