搜狗笔试题 园 自己的思路 不正确 求指正

import java.text.DecimalFormat; import java.util.LinkedList; import java.util.Queue; import java.util.Scanner; public class Sougou { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); double[] a = new double[n]; for (int i = 0; i < n; i++) { a[i] = sc.nextDouble(); } double pre = a[0]; for (int i = 0; i < n; i++){ if (i == 0){ a[0] = 360 - a[n - 1] + a[0]; }else{ double temp = a[i]; a[i] = a[i] - pre; pre = temp; } } double max = 0; double sum = 0; Queue<Double> queue = new LinkedList(); for (int i = 0; i < n; i++){ sum = sum + a[i]; queue.add(a[i]); while (sum > 180){ sum = sum - queue.peek(); } max = Math.max(max, sum); } DecimalFormat format = new DecimalFormat(); format.setMinimumFractionDigits(8); System.out.println(format.format(max)); } } 贴出来代码吧 不知道对不对 希望牛人来解释一下

看我刚发的帖子

想了想  其实还可以转化为求取  一个数组中的子数组最接近180的值