题目
思路
题解
package hwod;
import java.util.Arrays;
import java.util.Scanner;
public class FindGoldBox {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String[] inputs=sc.nextLine().split(",");
int[] boxs = Arrays.stream(inputs).mapToInt(Integer::parseInt).toArray();
System.out.println(findGoldBox(boxs));
}
private static int findGoldBox(int[] boxs) {
int start = 0, left = 0, right = 0;
for (int i = 1; i < boxs.length; i++) {
right += boxs[i];
}
while (left != right) {
left += boxs[start];
start++;
if(start>=boxs.length) return -1;
right -= boxs[start];
}
return start;
}
}