摘要: Problem : Reverse a linked list from position m to n . Do it in one pass. Note: 1 ≤ m ≤ n ≤ length of list. Example: 思路 : 保存2个节点 和`cur pre cur cur nex 阅读全文
posted @ 2020-02-15 23:31 littledy 阅读(97) 评论(0) 推荐(0)