2018年8月5日
426. Convert Binary Search Tree to Sorted Doubly Linked List把bst变成双向链表
摘要： ［抄题］： Convert a BST to a sorted circular doubly-linked list in-place. Think of the left and right pointers as synonymous to the previous and next poin 阅读全文
posted @ 2018-08-05 20:49 苗妙苗 阅读(484) 评论(0) 推荐(0)
725. Split Linked List in Parts把链表分成长度不超过1的若干部分
摘要： ［抄题］： Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list "parts". The length o 阅读全文
posted @ 2018-08-05 09:28 苗妙苗 阅读(145) 评论(0) 推荐(0)