Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 2130. Maximum Twin Sum of a Linked List

---

題目：


解答：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    int pairSum(ListNode* head) {
        ListNode *p = head;
        vector<int> q;

        while (p) {
            q.push_back(p->val);
            p = p->next;
        }

        int n = q.size();
        int ans = INT_MIN;

        for (int i = 0; i < n / 2; ++i) {
            ans = max(ans, q[i] + q[n - i - 1]);
        }

        return ans;
    }
};