java – 如何像Zig-zag算法一样求和
发布时间:2020-12-15 04:34:26 所属栏目:Java 来源:网络整理
导读:假设我有2个这样的数据: x = 1,and {10,20,30}. 我想这样总结: 1 + 10 = 11,11 + 20 = 31,and 31 + 30 = 61 我的代码. int x = 1;int[] arr = {10,30};int sum = 0;for (int i = 0; i arr.length; i++) { sum = arr[i] + x;} 我明白了: 1 + 10 = 11,1 + 2
假设我有2个这样的数据:
x = 1,and {10,20,30}. 我想这样总结: 1 + 10 = 11,11 + 20 = 31,and 31 + 30 = 61 我的代码. int x = 1; int[] arr = {10,30}; int sum = 0; for (int i = 0; i < arr.length; i++) { sum = arr[i] + x; } 我明白了: 1 + 10 = 11,1 + 20 = 21,and 1 + 30 = 31 and so on 如何解决这个问题呢? 解决方法
将sum初始化为x,并将arr [i]的值加到sum中,并且不将总和设置为arr [i] x.
int sum = x; // You only want to add x once,so just say the sum is equal to x for (int i = 0; i < arr.length; i++) { // You didn′t sum the values up,you just said the sum is equal to your // x value plus the element at arr[i] sum += arr[i]; } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |