Java容易理解

解题思路:

注意事项:

参考代码:

import java.util.*;

public class Main {

public static void main(String[] args) {

Scanner reader = new Scanner(System.in);

int n = reader.nextInt();

List list = new ArrayList();

for (int i = 0; i < n; i++)

list.add(reader.nextInt());

long sum = 0;

while (list.size() > 1) {

// 先找到最小的数字的下标

int i = 0;

int min = (int) list.get(0);

for (int j = 0; j < list.size() ; j++) {

if ((int) list.get(j ) < min) {

i = j;

min = (int) list.get(j);

}

}

// 计算最小的元素左右两边的与此珠子的能量和

int left = 0;

int right = 0;

if (i == 0) {

left = (int) list.get(list.size() - 1);

right = (int) list.get(1);

}

if (i == list.size() - 1) {

left = (int) list.get(list.size() - 2);

right = (int) list.get(0);

}

if (i > 0 && i < list.size() - 1) {

left = (int) list.get(i - 1);

right = (int) list.get(i + 1);

}

sum+=left*(int)list.get(i)*right;

list.remove(i);

}

System.out.println(sum);

}

}