力扣2130——链表最大孪生和（暴力，反转链表）

思路1、将链表中元素存数组里，然后取最大孪生和

class Solution {
public:
    int pairSum(ListNode* head) {
        vector<int> nums;
        int n = 0;
        while(head != nullptr) {
            nums.push_back(head->val);
            n++;
            head = head->next;
        }
        int ans = 0;
        for(int i = 0; i < n / 2; i++) {
            ans = max(ans, nums[i] + nums[n-i-1]);
        }
        return ans;
    }
};

思路2、快慢指针找中间点，反转后一半链表，双指针取最大孪生和

class Solution {
public:
    int pairSum(ListNode* head) {
        ListNode* slow = head;
        ListNode* fast = head->next;
        while(fast->next != nullptr) {
            slow = slow->next;
            fast = fast->next->next;
        }
        ListNode* right = slow->next;
        ListNode* tmp = right;
        while(right->next != nullptr) {
            tmp = right->next;
            right->next = right->next->next;
            tmp->next = slow->next;
            slow->next = tmp;              
        }
        int ans = 0;
        ListNode* i = head;
        ListNode* j = slow->next;
        for(; i != slow->next; i = i->next, j = j->next) {
            ans = max(ans, i->val + j->val);
        }
        return ans;        
    }
};