2019年8月10日
92. Reverse Linked List II
摘要： Reverse a linked list from position m to n. Do it in one-pass. Note: 1 ≤ m ≤ n ≤ length of list. Example: Input: 1->2->3->4->5->NULL, m = 2, n = 4 Out 阅读全文
posted @ 2019-08-10 09:44 Schwifty 阅读(151) 评论(0) 推荐(0)
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 阅读全文
posted @ 2019-08-10 05:17 Schwifty 阅读(138) 评论(0) 推荐(0)