leetcode143. 重排链表

class Solution {public: void reorderList(ListNode* head) { if(!head)return ; vector<ListNode*>v; ListNode*cur=head;


leetcode142. 环形链表 II

哈希/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };