Question

Given a linked list of integers, write a method that computes and prints the pairwise sums which is illustrated below with an example. If the linked list has values 5,3,2,9,3,15,22 from head to tail, the pairwise sums would be 8,5,11,12,18,37 which is the sum of two consecutive values from left to right. Notice the output will be of size one less than the original. You will output the pairwise sums exactly as above on a single line, comma separated. If the original list is of size 0 or 1 then print an appropriate error message. Make sure your code works for a linked list of any size, not just for the example above. Estimate the time-complexity of your algorithm.

This is what I have so far

import java.util.*;

public class PairwiseSums<Integer> extends LinkedList<Integer>
{
public String pairwise(LinkedList<Integer> list) {
LinkedList<Integer> list2=new LinkedList<Integer>();
int a, b;
if(list.size()<2)
return ("The list must have at least two values.");
else {
for (int i=0; i<list.size()-1;i++) {
  
  
}
}
}
}

Answer 1

import java.util.*;

public class PairwiseSums<Integer> extends LinkedList<Integer>
{

public String pairwise(LinkedList<Integer> list) {
LinkedList<Integer> list2=new LinkedList<Integer>();
int a, b;
String s="";
if(list.size()<2)
return ("The list must have at least two values.");
else {
for (int i=0; i<list.size()-1;i++) {
int n = list.get(i)+list.get(i+1);
list2.add(n);//adding to list
if(i==list.size()-2)
s=s+Integer.toString(n);
else
s=s+Integer.toString(n)+",";
  
}

}
return s;
}
  

}
  
//PLS give a thumbs up if you find this helpful, it helps me alot, thanks.