首页 > 代码库 > 86. Partition List
86. Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
You should preserve the original relative order of the nodes in each of the two partitions.
For example,
Given 1->4->3->2->5->2 and x = 3,
return 1->2->2->4->3->5.
public ListNode Partition(ListNode head, int x) { if(head == null) return head; ListNode smallStart =new ListNode(0); ListNode largeStart =new ListNode(0); ListNode p1 = smallStart; ListNode p2 = largeStart; //assign small and large pointer while(head != null) { if(head.val < x) { smallStart.next =head; smallStart = smallStart.next; } else { largeStart.next = head; largeStart = largeStart.next; } head = head.next; } largeStart.next = null; smallStart.next = p2.next; return p1.next; }
86. Partition List
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。