leetcode链表题23

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode tail(0),*set=&tail;
        while(l1&&l2){
            if(l1->val>l2->val){
                set->next=l2;
                l2=l2->next;
                set=set->next;
            }
            else{
                set->next=l1;
                l1=l1->next;
                set=set->next;
            }
        }
                  (set->next)=(l2?l2:l1);
        return tail.next;
    }
    ListNode* mergeKLists(vector<ListNode*>& lists) {
        int s1ze=lists.size();
        if(lists.empty())return NULL;
        if(s1ze=1)return lists[0];
        while(s1ze>1){
            for(int a=0;a<s1ze/2;++a){
                lists[a]=mergeTwoLists(lists[a],lists[s1ze-1-a]);
                s1ze=(s1ze+1)/2;
            }
        }
        return lists[0];
    }
};

已完成
执行用时: 8 ms
输入
[[1,4,5],[1,3,4],[2,6]]
输出
[1,4,5]
差别
预期结果
[1,1,2,3,4,4,5,6]

问题出现在倒数第十行的if语句中的判断 s1ze=1 正常应是s1ze==1;