代码实现(Java):
public class BalancePoint { public static void main(String[] args) { int[] numbers = { 1, 3, 5, 7, 8, 25, 4, 20 }; int front_sum; int back_sum; boolean isFound = false; for (int i = 0; i < numbers.length; i++) { front_sum = 0; back_sum = 0; for (int j = 0; j < i; j++) { front_sum += numbers[j]; } for (int j = i + 1; j < numbers.length; j++) { back_sum += numbers[j]; } if (front_sum == back_sum) { isFound = true; System.out.println("找到平衡点:" + numbers[i]); } } if (!isFound) { System.out.println("这个数据集中不包含平衡点!"); } } }