| 42 | }; |
| 43 | |
| 44 | int main() { |
| 45 | Solution s; |
| 46 | ListNode a(1); |
| 47 | ListNode b(4); |
| 48 | ListNode c(3); |
| 49 | ListNode d(2); |
| 50 | ListNode e(5); |
| 51 | ListNode f(2); |
| 52 | a.next = &b; |
| 53 | b.next = &c; |
| 54 | c.next = &d; |
| 55 | d.next = &e; |
| 56 | e.next = &f; |
| 57 | auto x = s.partition(&a,3); |
| 58 | while (x != NULL) { |
| 59 | cout << x->val << endl; |
| 60 | x = x->next; |
| 61 | } |
| 62 | return 0; |
| 63 | } |