-
Notifications
You must be signed in to change notification settings - Fork 50
/
2-5.cpp
62 lines (51 loc) · 1.01 KB
/
2-5.cpp
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
//2.4 in 5th edtion
#include<iostream>
using namespace std;
class ListNode{
public:
int val;
ListNode* next;
ListNode(int i): val(i),next(NULL){}
};
ListNode* parti(ListNode *head, int x){
ListNode* p=new ListNode(0);
p->next=head;
head= p;
while (p->next){
if (p->next->val<x){
ListNode* q= p->next;
p->next = p->next->next;
q->next = head->next;
head->next = q;
}else{
p=p->next;
}
}
return head->next;
}
ListNode* creatl(int* A,int n){
ListNode* head = new ListNode(A[0]);
ListNode* q=head;
for (int i=1;i<n;i++){
ListNode* p=new ListNode(A[i]);
q->next = p;
q=p;
}
return head;
}
void printList(ListNode* head){
if (head==NULL){cout << "Empty List" << endl; }
while (head!=NULL){
cout << head->val << " ";
head = head->next;
}
cout << endl;
}
int main(){
int A[12] = {9,8,7,4,5,3,2,8,4,3,6,0};
ListNode* head = creatl(A,12);
int x = 5;
ListNode* res = parti(head,x);
printList(res);
return 0;
}