【Lintcode】786. Linked List Weighted Sum In Reverse Order

题目地址：

https://www.lintcode.com/problem/linked-list-weighted-sum-in-reverse-order/description

给定一个单链表，求其节点的加权和，其中表尾的权重是$1$，倒数第二个节点权重是$2$，以此类推。

思路是利用前缀和。设链表为$a_n\to a_{n-1}\to ...\to a_1$，则：$$\begin{gathered} \sum _{i=1}^{n}i{a}_i=a_n+(a_n+a_{n-1})+...+(a_n+a_{n-1}+...+a_1) \\ =\sum _{k=1}^{k=n}\sum _{i=1}^k{a}_{n+1-i} \end{gathered}$$所以我们只需要对前缀和进行累加即可。代码如下：

public class Solution {
    /**
     * @param head: the given linked list
     * @return:  the weighted sum in reverse order
     */
    public int weightedSumReverse(ListNode head) {
        // ListNode -> val: the value of node ,ListNode -> next: the next node of this node
        // sum存链表的前缀和
        int res = 0, sum = 0;
        while (head != null) {
            sum += head.val;
            res += sum;
            head = head.next;
        }
        
        return res;
    }
}

class ListNode {
    int val;
    ListNode next;
    
    public ListNode(int x) {
        val = x;
    }
}

时间复杂度$O(n)$，空间$O(1)$。