摘要： class Solution {public: ListNode *reverseKGroup(ListNode *head, int k) { // Start typing your C/C++ solution below // DO NOT write int main() function int n=k; int len=0; ListNode *p=head; if (head == NULL || head->next == NULL||knext; } if (n > len) return head; ... 阅读全文

摘要： class Solution {public: ListNode *mergeKLists(vector &lists) { int n=lists.size(); if(n==0)return NULL; ListNode *head=new ListNode(INT_MIN); ListNode *ret=head; int min; bool finish; while(1) { finish=true; min... 阅读全文