Answer:
The method in Java is as follows:
public static ArrayList<Integer> appendPosSum(ArrayList<Integer> nums) {
int sum = 0;
ArrayList<Integer> newArr = new ArrayList<>();
for(int num : nums) {
if(num>0){
sum+=num;
newArr.add(num); } }
newArr.add(sum);
return newArr;
}
Explanation:
This defines the method; it receives an integer arraylist as its parameter; nums
public static ArrayList<Integer> appendPosSum(ArrayList<Integer> nums) {
This initializes sum to 0
int sum = 0;
This declares a new integer arraylist; newArr
ArrayList<Integer> newArr = new ArrayList<>();
This iterates through nums
for(int num : nums) {
If current element is greater than 0
if(num>0){
This sum is taken
sum+=num;
And the element is added to newArr
newArr.add(num); } }
At the end of the iteration; this adds the calculated sum to newArr
newArr.add(sum);
This returns newArr
return newArr;
}
A. if they have been previously competetive
I would save memories in my opinion thats the most important thing.
